./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_94-alloc_region_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 9a849f68 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_94-alloc_region_racing.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7faac9952fd378b53dcd8f21391daa9cc75834f7be2a5ad0c70d96fc8524bd08 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-9a849f6-m [2024-10-26 03:31:32,613 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-26 03:31:32,671 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2024-10-26 03:31:32,675 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-26 03:31:32,675 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-26 03:31:32,706 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-26 03:31:32,707 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-26 03:31:32,707 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-26 03:31:32,708 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-26 03:31:32,709 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-26 03:31:32,710 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-26 03:31:32,710 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-26 03:31:32,711 INFO L153 SettingsManager]: * Use SBE=true [2024-10-26 03:31:32,711 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-26 03:31:32,711 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-26 03:31:32,711 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-26 03:31:32,712 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-26 03:31:32,712 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-26 03:31:32,712 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-26 03:31:32,712 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-26 03:31:32,713 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-26 03:31:32,717 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-26 03:31:32,717 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-26 03:31:32,717 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-26 03:31:32,718 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-26 03:31:32,718 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-26 03:31:32,718 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-26 03:31:32,718 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-26 03:31:32,719 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-26 03:31:32,719 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-26 03:31:32,719 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-10-26 03:31:32,720 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-26 03:31:32,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-26 03:31:32,720 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-26 03:31:32,720 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-26 03:31:32,720 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-26 03:31:32,720 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-26 03:31:32,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-26 03:31:32,721 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-26 03:31:32,721 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-10-26 03:31:32,721 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-26 03:31:32,722 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-26 03:31:32,722 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-26 03:31:32,722 INFO L153 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:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> GemCutter 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 -> 7faac9952fd378b53dcd8f21391daa9cc75834f7be2a5ad0c70d96fc8524bd08 [2024-10-26 03:31:32,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-26 03:31:33,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-26 03:31:33,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-26 03:31:33,015 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-26 03:31:33,015 INFO L274 PluginConnector]: CDTParser initialized [2024-10-26 03:31:33,016 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_94-alloc_region_racing.i [2024-10-26 03:31:34,479 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-26 03:31:34,744 INFO L384 CDTParser]: Found 1 translation units. [2024-10-26 03:31:34,745 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_94-alloc_region_racing.i [2024-10-26 03:31:34,767 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/44f4cce7a/969930edf3b9499ca2a97f297afb9e04/FLAGd5300d91b [2024-10-26 03:31:35,066 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/44f4cce7a/969930edf3b9499ca2a97f297afb9e04 [2024-10-26 03:31:35,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-26 03:31:35,069 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-26 03:31:35,070 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-26 03:31:35,070 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-26 03:31:35,074 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-26 03:31:35,075 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 03:31:35" (1/1) ... [2024-10-26 03:31:35,076 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@186824ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:31:35, skipping insertion in model container [2024-10-26 03:31:35,076 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 03:31:35" (1/1) ... [2024-10-26 03:31:35,134 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-26 03:31:35,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-26 03:31:35,809 INFO L200 MainTranslator]: Completed pre-run [2024-10-26 03:31:35,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-26 03:31:35,957 INFO L204 MainTranslator]: Completed translation [2024-10-26 03:31:35,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:31:35 WrapperNode [2024-10-26 03:31:35,957 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-26 03:31:35,958 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-26 03:31:35,958 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-26 03:31:35,958 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-26 03:31:35,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:31:35" (1/1) ... [2024-10-26 03:31:35,999 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:31:35" (1/1) ... [2024-10-26 03:31:36,057 INFO L138 Inliner]: procedures = 378, calls = 83, calls flagged for inlining = 10, calls inlined = 11, statements flattened = 446 [2024-10-26 03:31:36,058 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-26 03:31:36,063 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-26 03:31:36,063 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-26 03:31:36,063 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-26 03:31:36,074 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:31:35" (1/1) ... [2024-10-26 03:31:36,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:31:35" (1/1) ... [2024-10-26 03:31:36,085 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:31:35" (1/1) ... [2024-10-26 03:31:36,086 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:31:35" (1/1) ... [2024-10-26 03:31:36,134 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:31:35" (1/1) ... [2024-10-26 03:31:36,144 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:31:35" (1/1) ... [2024-10-26 03:31:36,150 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:31:35" (1/1) ... [2024-10-26 03:31:36,156 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:31:35" (1/1) ... [2024-10-26 03:31:36,161 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-26 03:31:36,165 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-26 03:31:36,166 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-26 03:31:36,166 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-26 03:31:36,167 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:31:35" (1/1) ... [2024-10-26 03:31:36,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-26 03:31:36,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:31:36,205 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-26 03:31:36,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-26 03:31:36,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-26 03:31:36,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-10-26 03:31:36,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-26 03:31:36,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-10-26 03:31:36,245 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-26 03:31:36,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-26 03:31:36,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-26 03:31:36,245 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-26 03:31:36,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-26 03:31:36,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-26 03:31:36,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-10-26 03:31:36,246 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-26 03:31:36,246 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-26 03:31:36,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-26 03:31:36,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-26 03:31:36,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-26 03:31:36,248 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-26 03:31:36,433 INFO L238 CfgBuilder]: Building ICFG [2024-10-26 03:31:36,436 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-26 03:31:37,127 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-26 03:31:37,127 INFO L287 CfgBuilder]: Performing block encoding [2024-10-26 03:31:37,190 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-26 03:31:37,192 INFO L314 CfgBuilder]: Removed 23 assume(true) statements. [2024-10-26 03:31:37,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 03:31:37 BoogieIcfgContainer [2024-10-26 03:31:37,193 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-26 03:31:37,195 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-26 03:31:37,195 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-26 03:31:37,198 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-26 03:31:37,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 03:31:35" (1/3) ... [2024-10-26 03:31:37,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@256ac069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 03:31:37, skipping insertion in model container [2024-10-26 03:31:37,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:31:35" (2/3) ... [2024-10-26 03:31:37,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@256ac069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 03:31:37, skipping insertion in model container [2024-10-26 03:31:37,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 03:31:37" (3/3) ... [2024-10-26 03:31:37,202 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_94-alloc_region_racing.i [2024-10-26 03:31:37,218 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-26 03:31:37,218 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2024-10-26 03:31:37,218 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-26 03:31:37,347 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-26 03:31:37,405 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 03:31:37,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 03:31:37,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:31:37,409 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-26 03:31:37,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-26 03:31:37,455 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 03:31:37,466 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-10-26 03:31:37,474 INFO L333 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@122badc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 03:31:37,475 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-10-26 03:31:38,099 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-26 03:31:38,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:31:38,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1692091816, now seen corresponding path program 1 times [2024-10-26 03:31:38,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:31:38,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376673631] [2024-10-26 03:31:38,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:31:38,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:31:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:31:39,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:31:39,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:31:39,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376673631] [2024-10-26 03:31:39,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376673631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:31:39,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:31:39,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:31:39,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730955585] [2024-10-26 03:31:39,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:31:39,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:31:39,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:31:39,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:31:39,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:31:39,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:31:39,426 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:31:39,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.0) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:31:39,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:31:39,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:39,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-26 03:31:39,844 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-26 03:31:39,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:31:39,844 INFO L85 PathProgramCache]: Analyzing trace with hash 224964957, now seen corresponding path program 1 times [2024-10-26 03:31:39,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:31:39,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290327994] [2024-10-26 03:31:39,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:31:39,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:31:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:31:40,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:31:40,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:31:40,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290327994] [2024-10-26 03:31:40,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290327994] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:31:40,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:31:40,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:31:40,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322367853] [2024-10-26 03:31:40,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:31:40,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:31:40,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:31:40,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:31:40,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:31:40,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:31:40,618 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:31:40,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:31:40,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:40,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:31:41,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:41,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:41,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-26 03:31:41,002 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-26 03:31:41,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:31:41,002 INFO L85 PathProgramCache]: Analyzing trace with hash -116164990, now seen corresponding path program 1 times [2024-10-26 03:31:41,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:31:41,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578182536] [2024-10-26 03:31:41,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:31:41,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:31:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:31:41,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:31:41,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:31:41,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578182536] [2024-10-26 03:31:41,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578182536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:31:41,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:31:41,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:31:41,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299433229] [2024-10-26 03:31:41,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:31:41,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:31:41,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:31:41,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:31:41,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:31:41,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:31:41,555 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:31:41,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 24.6) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:31:41,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:41,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:41,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:31:41,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:41,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:41,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:41,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-26 03:31:41,940 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-26 03:31:41,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:31:41,940 INFO L85 PathProgramCache]: Analyzing trace with hash -321667639, now seen corresponding path program 1 times [2024-10-26 03:31:41,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:31:41,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700913148] [2024-10-26 03:31:41,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:31:41,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:31:42,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:31:42,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:31:42,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:31:42,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700913148] [2024-10-26 03:31:42,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700913148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:31:42,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:31:42,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:31:42,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178867813] [2024-10-26 03:31:42,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:31:42,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:31:42,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:31:42,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:31:42,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:31:42,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:31:42,558 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:31:42,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 26.0) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:31:42,559 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:42,559 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:42,559 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:42,559 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:31:42,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:42,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:42,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:42,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:42,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-26 03:31:42,949 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-26 03:31:42,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:31:42,950 INFO L85 PathProgramCache]: Analyzing trace with hash 5503531, now seen corresponding path program 1 times [2024-10-26 03:31:42,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:31:42,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937382377] [2024-10-26 03:31:42,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:31:42,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:31:42,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:31:43,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:31:43,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:31:43,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937382377] [2024-10-26 03:31:43,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937382377] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:31:43,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:31:43,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:31:43,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543886336] [2024-10-26 03:31:43,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:31:43,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:31:43,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:31:43,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:31:43,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:31:43,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:31:43,582 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:31:43,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 27.8) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:31:43,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:43,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:43,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:43,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:43,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:31:44,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:44,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:44,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:44,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:44,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:44,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-26 03:31:44,047 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-26 03:31:44,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:31:44,048 INFO L85 PathProgramCache]: Analyzing trace with hash 14722053, now seen corresponding path program 1 times [2024-10-26 03:31:44,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:31:44,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342495638] [2024-10-26 03:31:44,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:31:44,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:31:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:31:44,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:31:44,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:31:44,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342495638] [2024-10-26 03:31:44,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342495638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:31:44,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:31:44,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:31:44,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180552019] [2024-10-26 03:31:44,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:31:44,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:31:44,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:31:44,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:31:44,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:31:44,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:31:44,768 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:31:44,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 31.8) internal successors, (159), 6 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:31:44,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:44,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:44,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:44,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:44,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:44,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:31:45,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:45,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:45,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:45,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:45,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:45,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:45,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-26 03:31:45,232 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-26 03:31:45,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:31:45,233 INFO L85 PathProgramCache]: Analyzing trace with hash 630566678, now seen corresponding path program 1 times [2024-10-26 03:31:45,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:31:45,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445257838] [2024-10-26 03:31:45,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:31:45,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:31:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:31:45,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:31:45,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:31:45,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445257838] [2024-10-26 03:31:45,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445257838] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:31:45,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:31:45,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:31:45,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307964919] [2024-10-26 03:31:45,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:31:45,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:31:45,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:31:45,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:31:45,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:31:45,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:31:45,833 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:31:45,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 33.4) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:31:45,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:45,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:45,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:45,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:45,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:45,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:45,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:31:46,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:46,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:46,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:46,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:46,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:46,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:46,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:46,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-26 03:31:46,502 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr8ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-26 03:31:46,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:31:46,502 INFO L85 PathProgramCache]: Analyzing trace with hash 825583615, now seen corresponding path program 1 times [2024-10-26 03:31:46,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:31:46,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815196516] [2024-10-26 03:31:46,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:31:46,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:31:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:31:47,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:31:47,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:31:47,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815196516] [2024-10-26 03:31:47,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815196516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:31:47,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:31:47,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:31:47,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639156526] [2024-10-26 03:31:47,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:31:47,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:31:47,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:31:47,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:31:47,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:31:47,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:31:47,273 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:31:47,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 37.8) internal successors, (189), 6 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:31:47,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:47,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:47,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:47,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:47,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:47,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:47,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:47,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:31:47,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:47,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:47,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:47,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:47,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:47,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:47,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:47,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:47,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-26 03:31:47,796 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr8ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-26 03:31:47,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:31:47,796 INFO L85 PathProgramCache]: Analyzing trace with hash 132716771, now seen corresponding path program 1 times [2024-10-26 03:31:47,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:31:47,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017160933] [2024-10-26 03:31:47,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:31:47,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:31:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:31:48,721 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:31:48,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:31:48,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017160933] [2024-10-26 03:31:48,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017160933] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:31:48,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534978884] [2024-10-26 03:31:48,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:31:48,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:31:48,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:31:48,725 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:31:48,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-26 03:31:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:31:49,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-26 03:31:49,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:31:49,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-26 03:31:49,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-26 03:31:49,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:31:49,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-10-26 03:31:49,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:31:49,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-10-26 03:31:49,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:31:49,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:31:49,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:31:49,487 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:31:51,665 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse1 |c_t_funThread1of1ForFork0_#t~nondet49#1|)))) (and (forall ((v_ArrVal_1454 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet49#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1454) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse1))) (forall ((v_ArrVal_1454 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet49#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1454) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|))) (forall ((v_ArrVal_1454 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet49#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1454) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_1454 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet49#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1454) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2))))))) is different from false [2024-10-26 03:31:55,775 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:31:55,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534978884] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:31:55,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:31:55,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-10-26 03:31:55,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024264964] [2024-10-26 03:31:55,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:31:55,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-26 03:31:55,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:31:55,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-26 03:31:55,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=275, Unknown=19, NotChecked=36, Total=420 [2024-10-26 03:31:55,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:31:55,780 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:31:55,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 16.85) internal successors, (337), 21 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:31:55,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:55,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:55,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:55,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:55,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:55,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:55,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:55,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:55,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:31:55,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2024-10-26 03:31:55,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2024-10-26 03:31:57,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:57,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:57,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:57,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:57,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:57,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:57,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:57,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:57,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:31:57,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-26 03:31:57,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-26 03:31:57,604 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr8ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-26 03:31:57,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:31:57,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1894705520, now seen corresponding path program 1 times [2024-10-26 03:31:57,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:31:57,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330515684] [2024-10-26 03:31:57,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:31:57,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:31:57,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:31:57,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:31:57,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:31:57,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330515684] [2024-10-26 03:31:57,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330515684] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:31:57,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317333875] [2024-10-26 03:31:57,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:31:57,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:31:57,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:31:57,825 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:31:57,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-26 03:31:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:31:58,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-26 03:31:58,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:31:58,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:31:58,260 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:31:58,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:31:58,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317333875] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:31:58,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:31:58,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-26 03:31:58,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479315968] [2024-10-26 03:31:58,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:31:58,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-26 03:31:58,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:31:58,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-26 03:31:58,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-26 03:31:58,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:31:58,418 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:31:58,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 44.0) internal successors, (440), 10 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:31:58,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:58,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:58,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:58,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:58,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:58,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:58,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:58,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:31:58,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:31:58,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:32:00,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:00,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:00,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:00,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:00,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:00,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:00,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:00,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:00,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:32:00,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:00,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-26 03:32:00,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-26 03:32:00,283 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr7ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-26 03:32:00,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:32:00,284 INFO L85 PathProgramCache]: Analyzing trace with hash -497922510, now seen corresponding path program 1 times [2024-10-26 03:32:00,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:32:00,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232884826] [2024-10-26 03:32:00,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:32:00,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:32:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:32:01,294 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:32:01,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:32:01,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232884826] [2024-10-26 03:32:01,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232884826] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:32:01,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203662891] [2024-10-26 03:32:01,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:32:01,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:32:01,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:32:01,297 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:32:01,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-26 03:32:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:32:01,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-26 03:32:01,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:32:01,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-26 03:32:01,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-26 03:32:01,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:32:01,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-10-26 03:32:01,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:32:01,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-10-26 03:32:01,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:32:01,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:32:02,000 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:32:02,000 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:32:02,023 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2228 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2228) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) 0)) (forall ((v_ArrVal_2228 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2228) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) 0)) (forall ((v_ArrVal_2228 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2228) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0)) (forall ((v_ArrVal_2228 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2228) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) 0))) is different from false [2024-10-26 03:32:02,115 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_2228 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2228) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0)) (forall ((v_ArrVal_2228 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2228) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_2228 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2228) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) 0)) (forall ((v_ArrVal_2228 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2228) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) 0))))) is different from false [2024-10-26 03:32:02,132 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) (.cse1 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_2228 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2228) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0)) (forall ((v_ArrVal_2228 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2228) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_2228 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2228) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) 0)) (forall ((v_ArrVal_2228 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2228) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse2) 0))))) is different from false [2024-10-26 03:32:04,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-26 03:32:04,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203662891] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:32:04,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:32:04,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-10-26 03:32:04,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397424025] [2024-10-26 03:32:04,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:32:04,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-26 03:32:04,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:32:04,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-26 03:32:04,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=235, Unknown=3, NotChecked=102, Total=420 [2024-10-26 03:32:04,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:32:04,281 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:32:04,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 16.05) internal successors, (321), 21 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:32:04,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:04,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:04,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:04,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:04,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:04,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:04,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:04,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:04,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:32:04,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:04,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:32:05,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:05,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:05,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:05,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:05,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:05,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:05,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:05,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:05,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:32:05,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:05,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:32:05,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-26 03:32:06,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:32:06,134 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-26 03:32:06,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:32:06,134 INFO L85 PathProgramCache]: Analyzing trace with hash 761147142, now seen corresponding path program 1 times [2024-10-26 03:32:06,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:32:06,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016104289] [2024-10-26 03:32:06,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:32:06,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:32:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:32:06,933 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:32:06,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:32:06,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016104289] [2024-10-26 03:32:06,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016104289] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:32:06,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563170821] [2024-10-26 03:32:06,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:32:06,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:32:06,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:32:06,936 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:32:06,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-26 03:32:07,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:32:07,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-26 03:32:07,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:32:07,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-26 03:32:07,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-26 03:32:07,401 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:32:07,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-10-26 03:32:07,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:32:07,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-10-26 03:32:07,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:32:07,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:32:07,563 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:32:07,563 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:32:07,582 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2579 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet44#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2579) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_2579 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet44#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2579) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)))) (forall ((v_ArrVal_2579 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2579) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet44#1|)) (forall ((v_ArrVal_2579 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet44#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2579) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|)))) is different from false [2024-10-26 03:32:07,664 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse1 |c_t_funThread1of1ForFork0_#t~nondet44#1|)))) (and (forall ((v_ArrVal_2579 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet44#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2579) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse1))) (forall ((v_ArrVal_2579 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2579) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet44#1|)) (forall ((v_ArrVal_2579 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet44#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2579) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_2579 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2579) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet44#1|))))) is different from false [2024-10-26 03:32:11,776 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-26 03:32:11,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563170821] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:32:11,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:32:11,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-10-26 03:32:11,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163668161] [2024-10-26 03:32:11,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:32:11,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-26 03:32:11,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:32:11,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-26 03:32:11,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=251, Unknown=11, NotChecked=70, Total=420 [2024-10-26 03:32:11,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:32:11,780 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:32:11,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 14.65) internal successors, (293), 21 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:32:11,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:11,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:11,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:11,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:11,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:11,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:11,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:11,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:11,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:32:11,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:11,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:32:11,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:32:14,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:14,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:14,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:14,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:14,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:14,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:14,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:14,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:14,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:32:14,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:14,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:32:14,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:32:15,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-26 03:32:15,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-26 03:32:15,196 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-26 03:32:15,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:32:15,196 INFO L85 PathProgramCache]: Analyzing trace with hash 854399623, now seen corresponding path program 1 times [2024-10-26 03:32:15,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:32:15,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082626169] [2024-10-26 03:32:15,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:32:15,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:32:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:32:16,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:32:16,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:32:16,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082626169] [2024-10-26 03:32:16,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082626169] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:32:16,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727595312] [2024-10-26 03:32:16,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:32:16,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:32:16,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:32:16,489 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:32:16,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-26 03:32:16,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:32:16,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-26 03:32:16,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:32:16,857 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-26 03:32:16,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-26 03:32:17,015 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:32:17,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-26 03:32:17,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-26 03:32:17,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-26 03:32:17,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:32:17,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-10-26 03:32:17,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:32:17,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-10-26 03:32:17,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:32:17,485 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:32:17,485 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:32:17,507 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2877 (Array Int Int))) (= |c_t_funThread1of1ForFork0_insert_#t~nondet35#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2877) |c_t_funThread1of1ForFork0_insert_~list#1.base|) |c_t_funThread1of1ForFork0_insert_~list#1.offset|))) (forall ((v_ArrVal_2877 (Array Int Int))) (= |c_t_funThread1of1ForFork0_insert_#t~nondet35#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2877) |c_t_funThread1of1ForFork0_insert_~list#1.base|) (+ |c_t_funThread1of1ForFork0_insert_~list#1.offset| 1)))) (forall ((v_ArrVal_2877 (Array Int Int))) (= |c_t_funThread1of1ForFork0_insert_#t~nondet35#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2877) |c_t_funThread1of1ForFork0_insert_~list#1.base|) (+ |c_t_funThread1of1ForFork0_insert_~list#1.offset| 3)))) (forall ((v_ArrVal_2877 (Array Int Int))) (= |c_t_funThread1of1ForFork0_insert_#t~nondet35#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2877) |c_t_funThread1of1ForFork0_insert_~list#1.base|) (+ |c_t_funThread1of1ForFork0_insert_~list#1.offset| 2))))) is different from false [2024-10-26 03:32:17,594 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_insert_~list#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_insert_~list#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_insert_~list#1.base|) .cse1 |c_t_funThread1of1ForFork0_insert_#t~nondet35#1|)))) (and (forall ((v_ArrVal_2877 (Array Int Int))) (= |c_t_funThread1of1ForFork0_insert_#t~nondet35#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2877) |c_t_funThread1of1ForFork0_insert_~list#1.base|) (+ |c_t_funThread1of1ForFork0_insert_~list#1.offset| 1)))) (forall ((v_ArrVal_2877 (Array Int Int))) (= |c_t_funThread1of1ForFork0_insert_#t~nondet35#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2877) |c_t_funThread1of1ForFork0_insert_~list#1.base|) (+ |c_t_funThread1of1ForFork0_insert_~list#1.offset| 2)))) (forall ((v_ArrVal_2877 (Array Int Int))) (= |c_t_funThread1of1ForFork0_insert_#t~nondet35#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2877) |c_t_funThread1of1ForFork0_insert_~list#1.base|) .cse1))) (forall ((v_ArrVal_2877 (Array Int Int))) (= |c_t_funThread1of1ForFork0_insert_#t~nondet35#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2877) |c_t_funThread1of1ForFork0_insert_~list#1.base|) |c_t_funThread1of1ForFork0_insert_~list#1.offset|)))))) is different from false [2024-10-26 03:32:23,769 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:32:23,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 51 [2024-10-26 03:32:23,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:32:23,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 32 [2024-10-26 03:32:23,785 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2024-10-26 03:32:23,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1 [2024-10-26 03:32:23,790 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2024-10-26 03:32:23,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1 [2024-10-26 03:32:23,794 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2024-10-26 03:32:23,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1 [2024-10-26 03:32:28,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-26 03:32:28,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727595312] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:32:28,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:32:28,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 32 [2024-10-26 03:32:28,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485217376] [2024-10-26 03:32:28,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:32:28,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-26 03:32:28,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:32:28,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-26 03:32:28,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=785, Unknown=23, NotChecked=118, Total=1056 [2024-10-26 03:32:28,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:32:28,008 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:32:28,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 13.03125) internal successors, (417), 33 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:32:28,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:28,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:28,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:28,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:28,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:28,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:28,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:28,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:28,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:32:28,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:28,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:32:28,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:32:28,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:32:34,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:34,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:34,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:34,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:34,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:34,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:34,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:34,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:34,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:32:34,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:34,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:32:34,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:32:34,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-26 03:32:34,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-26 03:32:34,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-26 03:32:34,468 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-26 03:32:34,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:32:34,468 INFO L85 PathProgramCache]: Analyzing trace with hash 648737749, now seen corresponding path program 1 times [2024-10-26 03:32:34,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:32:34,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556183860] [2024-10-26 03:32:34,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:32:34,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:32:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:32:35,161 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:32:35,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:32:35,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556183860] [2024-10-26 03:32:35,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556183860] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:32:35,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926165346] [2024-10-26 03:32:35,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:32:35,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:32:35,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:32:35,164 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:32:35,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-26 03:32:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:32:35,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-26 03:32:35,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:32:35,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-26 03:32:35,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-26 03:32:35,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:32:35,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-10-26 03:32:35,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:32:35,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2024-10-26 03:32:35,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:32:35,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 03:32:35,776 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:32:35,777 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:32:35,792 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3144 (Array Int Int))) (= |c_t_funThread1of1ForFork0_insert_#t~nondet34#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3144) |c_t_funThread1of1ForFork0_insert_~p#1.base|) (+ |c_t_funThread1of1ForFork0_insert_~p#1.offset| 6)))) (forall ((v_ArrVal_3144 (Array Int Int))) (= |c_t_funThread1of1ForFork0_insert_#t~nondet34#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3144) |c_t_funThread1of1ForFork0_insert_~p#1.base|) (+ 5 |c_t_funThread1of1ForFork0_insert_~p#1.offset|)))) (forall ((v_ArrVal_3144 (Array Int Int))) (= |c_t_funThread1of1ForFork0_insert_#t~nondet34#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3144) |c_t_funThread1of1ForFork0_insert_~p#1.base|) (+ |c_t_funThread1of1ForFork0_insert_~p#1.offset| 4)))) (forall ((v_ArrVal_3144 (Array Int Int))) (= |c_t_funThread1of1ForFork0_insert_#t~nondet34#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3144) |c_t_funThread1of1ForFork0_insert_~p#1.base|) (+ 7 |c_t_funThread1of1ForFork0_insert_~p#1.offset|))))) is different from false [2024-10-26 03:32:35,886 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 |c_t_funThread1of1ForFork0_insert_~p#1.offset|))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_insert_~p#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_insert_~p#1.base|) .cse1 |c_t_funThread1of1ForFork0_insert_#t~nondet34#1|)))) (and (forall ((v_ArrVal_3144 (Array Int Int))) (= |c_t_funThread1of1ForFork0_insert_#t~nondet34#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3144) |c_t_funThread1of1ForFork0_insert_~p#1.base|) (+ |c_t_funThread1of1ForFork0_insert_~p#1.offset| 6)))) (forall ((v_ArrVal_3144 (Array Int Int))) (= |c_t_funThread1of1ForFork0_insert_#t~nondet34#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3144) |c_t_funThread1of1ForFork0_insert_~p#1.base|) .cse1))) (forall ((v_ArrVal_3144 (Array Int Int))) (= |c_t_funThread1of1ForFork0_insert_#t~nondet34#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3144) |c_t_funThread1of1ForFork0_insert_~p#1.base|) (+ 5 |c_t_funThread1of1ForFork0_insert_~p#1.offset|)))) (forall ((v_ArrVal_3144 (Array Int Int))) (= |c_t_funThread1of1ForFork0_insert_#t~nondet34#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3144) |c_t_funThread1of1ForFork0_insert_~p#1.base|) (+ |c_t_funThread1of1ForFork0_insert_~p#1.offset| 4))))))) is different from false [2024-10-26 03:32:35,903 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t_funThread1of1ForFork0_insert_~p#1.offset| 6)) (.cse1 (+ 7 |c_t_funThread1of1ForFork0_insert_~p#1.offset|))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_insert_~p#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_insert_~p#1.base|) .cse2 |c_t_funThread1of1ForFork0_insert_#t~nondet34#1|) .cse1 |c_t_funThread1of1ForFork0_insert_#t~nondet34#1|)))) (and (forall ((v_ArrVal_3144 (Array Int Int))) (= |c_t_funThread1of1ForFork0_insert_#t~nondet34#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3144) |c_t_funThread1of1ForFork0_insert_~p#1.base|) (+ |c_t_funThread1of1ForFork0_insert_~p#1.offset| 4)))) (forall ((v_ArrVal_3144 (Array Int Int))) (= |c_t_funThread1of1ForFork0_insert_#t~nondet34#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3144) |c_t_funThread1of1ForFork0_insert_~p#1.base|) (+ 5 |c_t_funThread1of1ForFork0_insert_~p#1.offset|)))) (forall ((v_ArrVal_3144 (Array Int Int))) (= |c_t_funThread1of1ForFork0_insert_#t~nondet34#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3144) |c_t_funThread1of1ForFork0_insert_~p#1.base|) .cse1))) (forall ((v_ArrVal_3144 (Array Int Int))) (= |c_t_funThread1of1ForFork0_insert_#t~nondet34#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3144) |c_t_funThread1of1ForFork0_insert_~p#1.base|) .cse2)))))) is different from false [2024-10-26 03:32:37,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:32:37,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 53 [2024-10-26 03:32:37,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:32:37,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 32 [2024-10-26 03:32:37,994 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:32:37,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 03:32:37,999 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:32:37,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 03:32:38,008 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:32:38,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-26 03:32:38,152 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-26 03:32:38,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926165346] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:32:38,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:32:38,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2024-10-26 03:32:38,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403790412] [2024-10-26 03:32:38,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:32:38,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-26 03:32:38,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:32:38,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-26 03:32:38,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=490, Unknown=14, NotChecked=144, Total=756 [2024-10-26 03:32:38,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:32:38,155 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:32:38,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 9.185185185185185) internal successors, (248), 28 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:32:38,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:38,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:38,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:38,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:38,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:38,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:38,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:38,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:38,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:32:38,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:38,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:32:38,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:32:38,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-10-26 03:32:38,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:32:40,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:40,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:40,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:40,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:40,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:40,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:40,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:40,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:40,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:32:40,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:40,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:32:40,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:32:40,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-26 03:32:40,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:32:40,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-26 03:32:40,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-26 03:32:40,615 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-26 03:32:40,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:32:40,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1710785580, now seen corresponding path program 1 times [2024-10-26 03:32:40,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:32:40,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636242826] [2024-10-26 03:32:40,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:32:40,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:32:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:32:41,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:32:41,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:32:41,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636242826] [2024-10-26 03:32:41,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636242826] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:32:41,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044710537] [2024-10-26 03:32:41,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:32:41,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:32:41,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:32:41,765 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:32:41,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-26 03:32:42,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:32:42,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-26 03:32:42,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:32:42,112 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-26 03:32:42,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-26 03:32:42,239 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:32:42,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-26 03:32:42,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-26 03:32:42,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-26 03:32:42,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:32:42,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-10-26 03:32:42,468 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:32:42,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-10-26 03:32:42,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:32:42,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:32:42,604 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:32:42,740 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_insert_~list#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_insert_~list#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_insert_~list#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_3383 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3383) |c_t_funThread1of1ForFork0_insert_~list#1.base|) (+ |c_t_funThread1of1ForFork0_insert_~list#1.offset| 2)) 0)) (forall ((v_ArrVal_3383 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3383) |c_t_funThread1of1ForFork0_insert_~list#1.base|) .cse1) 0)) (forall ((v_ArrVal_3383 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3383) |c_t_funThread1of1ForFork0_insert_~list#1.base|) |c_t_funThread1of1ForFork0_insert_~list#1.offset|) 0)) (forall ((v_ArrVal_3383 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3383) |c_t_funThread1of1ForFork0_insert_~list#1.base|) (+ |c_t_funThread1of1ForFork0_insert_~list#1.offset| 1)) 0))))) is different from false [2024-10-26 03:32:47,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:32:47,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 49 [2024-10-26 03:32:47,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:32:47,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 34 [2024-10-26 03:32:47,151 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2024-10-26 03:32:47,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1 [2024-10-26 03:32:47,155 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2024-10-26 03:32:47,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1 [2024-10-26 03:32:47,161 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2024-10-26 03:32:47,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1 [2024-10-26 03:32:53,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:32:53,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044710537] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:32:53,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:32:53,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 33 [2024-10-26 03:32:53,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515149408] [2024-10-26 03:32:53,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:32:53,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-26 03:32:53,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:32:53,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-26 03:32:53,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=900, Unknown=43, NotChecked=62, Total=1122 [2024-10-26 03:32:53,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:32:53,429 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:32:53,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 11.212121212121213) internal successors, (370), 34 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:32:53,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:53,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:53,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:53,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:53,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:53,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:53,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:53,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:53,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:32:53,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:53,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:32:53,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:32:53,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-10-26 03:32:53,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:32:53,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:32:55,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:55,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:55,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:55,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:55,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:55,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:55,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:55,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:55,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:32:55,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:55,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:32:55,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:32:55,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-26 03:32:55,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:32:55,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-26 03:32:55,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-26 03:32:56,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:32:56,100 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-26 03:32:56,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:32:56,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1146053009, now seen corresponding path program 1 times [2024-10-26 03:32:56,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:32:56,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386201072] [2024-10-26 03:32:56,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:32:56,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:32:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:32:56,697 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:32:56,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:32:56,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386201072] [2024-10-26 03:32:56,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386201072] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:32:56,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053975677] [2024-10-26 03:32:56,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:32:56,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:32:56,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:32:56,700 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:32:56,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-26 03:32:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:32:56,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-26 03:32:56,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:32:57,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-26 03:32:57,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-26 03:32:57,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:32:57,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-10-26 03:32:57,151 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:32:57,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2024-10-26 03:32:57,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:32:57,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 03:32:57,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:32:57,259 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:32:57,274 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3602 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet32#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3602) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 6)))) (forall ((v_ArrVal_3602 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet32#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3602) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 5)))) (forall ((v_ArrVal_3602 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet32#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3602) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 4)))) (forall ((v_ArrVal_3602 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet32#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3602) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 7))))) is different from false [2024-10-26 03:32:57,338 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 7))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1 |c_t_funThread1of1ForFork0_init_#t~nondet32#1|)))) (and (forall ((v_ArrVal_3602 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet32#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3602) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 5)))) (forall ((v_ArrVal_3602 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet32#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3602) |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1))) (forall ((v_ArrVal_3602 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet32#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3602) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 6)))) (forall ((v_ArrVal_3602 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet32#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3602) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 4))))))) is different from false [2024-10-26 03:33:01,516 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-26 03:33:01,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053975677] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:33:01,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:33:01,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2024-10-26 03:33:01,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965810335] [2024-10-26 03:33:01,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:33:01,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-26 03:33:01,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:33:01,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-26 03:33:01,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=539, Unknown=13, NotChecked=98, Total=756 [2024-10-26 03:33:01,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:33:01,519 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:33:01,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 7.148148148148148) internal successors, (193), 28 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:33:01,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:01,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:01,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:01,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:01,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:01,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:01,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:01,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:01,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:33:01,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:01,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:33:01,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:33:01,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-10-26 03:33:01,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:33:01,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-10-26 03:33:01,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:33:03,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:03,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:03,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:03,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:03,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:03,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:03,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:03,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:03,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:33:03,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:03,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:33:03,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:33:03,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-26 03:33:03,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:33:03,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-26 03:33:03,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:33:03,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-26 03:33:04,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-26 03:33:04,133 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-26 03:33:04,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:33:04,133 INFO L85 PathProgramCache]: Analyzing trace with hash -801948412, now seen corresponding path program 1 times [2024-10-26 03:33:04,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:33:04,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418506319] [2024-10-26 03:33:04,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:33:04,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:33:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:33:04,542 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:33:04,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:33:04,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418506319] [2024-10-26 03:33:04,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418506319] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:33:04,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540350054] [2024-10-26 03:33:04,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:33:04,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:33:04,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:33:04,544 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:33:04,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-26 03:33:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:33:04,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-26 03:33:04,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:33:04,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-26 03:33:04,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-26 03:33:04,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:33:04,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-10-26 03:33:04,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:33:04,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-10-26 03:33:05,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:33:05,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:33:05,039 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:33:05,039 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:33:05,052 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3791 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3791) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 1)) |c_t_funThread1of1ForFork0_init_#t~nondet31#1|)) (forall ((v_ArrVal_3791 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet31#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3791) |c_t_funThread1of1ForFork0_init_~p#1.base|) |c_t_funThread1of1ForFork0_init_~p#1.offset|))) (forall ((v_ArrVal_3791 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet31#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3791) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 2)))) (forall ((v_ArrVal_3791 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3791) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 3)) |c_t_funThread1of1ForFork0_init_#t~nondet31#1|))) is different from false [2024-10-26 03:33:05,125 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1 |c_t_funThread1of1ForFork0_init_#t~nondet31#1|)))) (and (forall ((v_ArrVal_3791 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3791) |c_t_funThread1of1ForFork0_init_~p#1.base|) |c_t_funThread1of1ForFork0_init_~p#1.offset|) |c_t_funThread1of1ForFork0_init_#t~nondet31#1|)) (forall ((v_ArrVal_3791 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet31#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3791) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 2)))) (forall ((v_ArrVal_3791 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3791) |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1) |c_t_funThread1of1ForFork0_init_#t~nondet31#1|)) (forall ((v_ArrVal_3791 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3791) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 1)) |c_t_funThread1of1ForFork0_init_#t~nondet31#1|))))) is different from false [2024-10-26 03:33:09,295 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-26 03:33:09,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540350054] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:33:09,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:33:09,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2024-10-26 03:33:09,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958208437] [2024-10-26 03:33:09,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:33:09,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-26 03:33:09,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:33:09,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-26 03:33:09,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=539, Unknown=11, NotChecked=98, Total=756 [2024-10-26 03:33:09,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:33:09,298 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:33:09,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 6.555555555555555) internal successors, (177), 28 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:33:09,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:09,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:09,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:09,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:09,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:09,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:09,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:09,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:09,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:33:09,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:09,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:33:09,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:33:09,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-10-26 03:33:09,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:33:09,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-10-26 03:33:09,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:33:09,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:33:10,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:10,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:10,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:10,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:10,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:10,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:10,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:10,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:10,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:33:10,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:10,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:33:10,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:33:10,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-26 03:33:10,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:33:10,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-26 03:33:10,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:33:10,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:33:10,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (9 of 10 remaining) [2024-10-26 03:33:10,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2024-10-26 03:33:10,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2024-10-26 03:33:10,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2024-10-26 03:33:10,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2024-10-26 03:33:10,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr9ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2024-10-26 03:33:10,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2024-10-26 03:33:10,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr7ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2024-10-26 03:33:10,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr6ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2024-10-26 03:33:10,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr8ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2024-10-26 03:33:10,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-26 03:33:11,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-26 03:33:11,191 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-26 03:33:11,193 INFO L312 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2024-10-26 03:33:11,202 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 03:33:11,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 03:33:11,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:33:11,206 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-26 03:33:11,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (12)] Waiting until timeout for monitored process [2024-10-26 03:33:11,212 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 03:33:11,212 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-26 03:33:11,213 INFO L333 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@122badc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 03:33:11,213 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-10-26 03:33:11,231 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-26 03:33:11,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:33:11,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1498853862, now seen corresponding path program 1 times [2024-10-26 03:33:11,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:33:11,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652937948] [2024-10-26 03:33:11,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:33:11,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:33:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:33:11,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:33:11,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:33:11,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652937948] [2024-10-26 03:33:11,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652937948] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:33:11,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:33:11,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:33:11,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946801912] [2024-10-26 03:33:11,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:33:11,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:33:11,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:33:11,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:33:11,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:33:11,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:33:11,367 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:33:11,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:33:11,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:33:11,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:11,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-26 03:33:11,393 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-26 03:33:11,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:33:11,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1333600576, now seen corresponding path program 1 times [2024-10-26 03:33:11,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:33:11,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327246016] [2024-10-26 03:33:11,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:33:11,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:33:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:33:11,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:33:11,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:33:11,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327246016] [2024-10-26 03:33:11,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327246016] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:33:11,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:33:11,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:33:11,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95858216] [2024-10-26 03:33:11,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:33:11,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:33:11,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:33:11,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:33:11,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:33:11,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:33:11,547 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:33:11,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:33:11,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:11,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:33:11,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:11,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:11,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-26 03:33:11,585 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-26 03:33:11,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:33:11,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1170861615, now seen corresponding path program 1 times [2024-10-26 03:33:11,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:33:11,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629701835] [2024-10-26 03:33:11,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:33:11,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:33:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:33:11,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:33:11,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:33:11,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629701835] [2024-10-26 03:33:11,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629701835] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:33:11,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:33:11,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:33:11,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651596470] [2024-10-26 03:33:11,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:33:11,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:33:11,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:33:11,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:33:11,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:33:11,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:33:11,750 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:33:11,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:33:11,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:11,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:11,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:33:11,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:11,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:11,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:11,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-26 03:33:11,819 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-26 03:33:11,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:33:11,820 INFO L85 PathProgramCache]: Analyzing trace with hash 91996484, now seen corresponding path program 1 times [2024-10-26 03:33:11,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:33:11,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083696505] [2024-10-26 03:33:11,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:33:11,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:33:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:33:12,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:33:12,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:33:12,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083696505] [2024-10-26 03:33:12,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083696505] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:33:12,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:33:12,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:33:12,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518477254] [2024-10-26 03:33:12,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:33:12,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:33:12,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:33:12,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:33:12,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:33:12,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:33:12,076 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:33:12,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:33:12,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:12,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:12,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:12,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:33:12,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:12,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:12,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:12,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:12,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-26 03:33:12,172 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-26 03:33:12,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:33:12,173 INFO L85 PathProgramCache]: Analyzing trace with hash -523586412, now seen corresponding path program 1 times [2024-10-26 03:33:12,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:33:12,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602774603] [2024-10-26 03:33:12,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:33:12,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:33:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:33:12,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:33:12,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:33:12,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602774603] [2024-10-26 03:33:12,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602774603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:33:12,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:33:12,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:33:12,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066011653] [2024-10-26 03:33:12,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:33:12,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:33:12,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:33:12,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:33:12,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:33:12,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:33:12,400 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:33:12,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:33:12,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:12,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:12,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:12,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:12,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:33:12,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:12,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:12,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:12,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:12,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:12,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-26 03:33:12,626 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-26 03:33:12,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:33:12,626 INFO L85 PathProgramCache]: Analyzing trace with hash 527808276, now seen corresponding path program 1 times [2024-10-26 03:33:12,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:33:12,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360556965] [2024-10-26 03:33:12,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:33:12,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:33:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-26 03:33:12,653 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-26 03:33:12,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-26 03:33:12,703 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-26 03:33:12,704 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-26 03:33:12,704 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 20 remaining) [2024-10-26 03:33:12,704 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining) [2024-10-26 03:33:12,704 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining) [2024-10-26 03:33:12,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining) [2024-10-26 03:33:12,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (15 of 20 remaining) [2024-10-26 03:33:12,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (14 of 20 remaining) [2024-10-26 03:33:12,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (13 of 20 remaining) [2024-10-26 03:33:12,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining) [2024-10-26 03:33:12,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining) [2024-10-26 03:33:12,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining) [2024-10-26 03:33:12,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (9 of 20 remaining) [2024-10-26 03:33:12,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (8 of 20 remaining) [2024-10-26 03:33:12,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining) [2024-10-26 03:33:12,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining) [2024-10-26 03:33:12,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining) [2024-10-26 03:33:12,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining) [2024-10-26 03:33:12,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining) [2024-10-26 03:33:12,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining) [2024-10-26 03:33:12,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining) [2024-10-26 03:33:12,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining) [2024-10-26 03:33:12,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-26 03:33:12,711 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-26 03:33:12,712 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2024-10-26 03:33:12,712 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-26 03:33:12,712 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-26 03:33:12,777 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-26 03:33:12,788 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 03:33:12,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 03:33:12,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:33:12,790 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-26 03:33:12,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (13)] Waiting until timeout for monitored process [2024-10-26 03:33:12,794 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 03:33:12,795 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of2ForFork0 ======== [2024-10-26 03:33:12,795 INFO L333 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@122badc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 03:33:12,795 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-10-26 03:33:13,105 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-26 03:33:13,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:33:13,106 INFO L85 PathProgramCache]: Analyzing trace with hash -316339307, now seen corresponding path program 1 times [2024-10-26 03:33:13,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:33:13,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409395210] [2024-10-26 03:33:13,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:33:13,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:33:13,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:33:13,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:33:13,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:33:13,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409395210] [2024-10-26 03:33:13,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409395210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:33:13,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:33:13,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:33:13,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961669507] [2024-10-26 03:33:13,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:33:13,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:33:13,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:33:13,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:33:13,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:33:13,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:33:13,395 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:33:13,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.0) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:33:13,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:33:13,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:13,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-26 03:33:13,735 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-26 03:33:13,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:33:13,736 INFO L85 PathProgramCache]: Analyzing trace with hash -792837606, now seen corresponding path program 1 times [2024-10-26 03:33:13,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:33:13,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813804705] [2024-10-26 03:33:13,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:33:13,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:33:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:33:14,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:33:14,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:33:14,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813804705] [2024-10-26 03:33:14,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813804705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:33:14,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:33:14,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:33:14,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828902713] [2024-10-26 03:33:14,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:33:14,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:33:14,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:33:14,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:33:14,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:33:14,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:33:14,038 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:33:14,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:33:14,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:14,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:33:14,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:14,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:14,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-26 03:33:14,404 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-26 03:33:14,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:33:14,404 INFO L85 PathProgramCache]: Analyzing trace with hash 67355966, now seen corresponding path program 1 times [2024-10-26 03:33:14,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:33:14,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948682881] [2024-10-26 03:33:14,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:33:14,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:33:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:33:14,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:33:14,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:33:14,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948682881] [2024-10-26 03:33:14,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948682881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:33:14,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:33:14,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:33:14,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479159774] [2024-10-26 03:33:14,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:33:14,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:33:14,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:33:14,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:33:14,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:33:14,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:33:14,738 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:33:14,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 24.6) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:33:14,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:14,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:14,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:33:14,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:14,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:14,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:14,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-26 03:33:14,996 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-26 03:33:14,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:33:14,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1111322330, now seen corresponding path program 1 times [2024-10-26 03:33:14,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:33:14,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947877787] [2024-10-26 03:33:14,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:33:14,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:33:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:33:15,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:33:15,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:33:15,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947877787] [2024-10-26 03:33:15,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947877787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:33:15,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:33:15,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:33:15,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328876305] [2024-10-26 03:33:15,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:33:15,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:33:15,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:33:15,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:33:15,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:33:15,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:33:15,346 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:33:15,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 26.0) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:33:15,346 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:15,346 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:15,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:15,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:33:15,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:15,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:15,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:15,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:15,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-26 03:33:15,656 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-26 03:33:15,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:33:15,656 INFO L85 PathProgramCache]: Analyzing trace with hash -383620633, now seen corresponding path program 1 times [2024-10-26 03:33:15,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:33:15,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858639014] [2024-10-26 03:33:15,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:33:15,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:33:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:33:15,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:33:15,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:33:15,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858639014] [2024-10-26 03:33:15,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858639014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:33:15,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:33:15,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:33:15,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377754900] [2024-10-26 03:33:15,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:33:15,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:33:15,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:33:15,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:33:15,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:33:15,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:33:15,969 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:33:15,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 27.8) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:33:15,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:15,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:15,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:15,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:15,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:33:16,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:16,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:16,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:16,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:16,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:16,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-26 03:33:16,457 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-26 03:33:16,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:33:16,458 INFO L85 PathProgramCache]: Analyzing trace with hash -150803199, now seen corresponding path program 1 times [2024-10-26 03:33:16,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:33:16,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286414227] [2024-10-26 03:33:16,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:33:16,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:33:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:33:16,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:33:16,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:33:16,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286414227] [2024-10-26 03:33:16,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286414227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:33:16,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:33:16,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:33:16,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410903635] [2024-10-26 03:33:16,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:33:16,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:33:16,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:33:16,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:33:16,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:33:16,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:33:16,866 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:33:16,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 31.8) internal successors, (159), 6 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:33:16,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:16,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:16,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:16,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:16,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:16,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:33:17,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:17,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:17,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:17,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:17,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:17,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:17,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-26 03:33:17,306 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-26 03:33:17,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:33:17,306 INFO L85 PathProgramCache]: Analyzing trace with hash -2110453614, now seen corresponding path program 1 times [2024-10-26 03:33:17,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:33:17,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468672752] [2024-10-26 03:33:17,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:33:17,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:33:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:33:17,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:33:17,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:33:17,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468672752] [2024-10-26 03:33:17,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468672752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:33:17,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:33:17,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:33:17,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515508362] [2024-10-26 03:33:17,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:33:17,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:33:17,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:33:17,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:33:17,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:33:17,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:33:17,753 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:33:17,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 33.4) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:33:17,753 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:17,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:17,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:17,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:17,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:17,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:17,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:33:18,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:18,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:18,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:18,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:18,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:18,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:18,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:18,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-26 03:33:18,360 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr8ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-26 03:33:18,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:33:18,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1452713253, now seen corresponding path program 1 times [2024-10-26 03:33:18,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:33:18,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160585769] [2024-10-26 03:33:18,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:33:18,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:33:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:33:18,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:33:18,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:33:18,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160585769] [2024-10-26 03:33:18,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160585769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:33:18,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:33:18,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:33:18,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829665251] [2024-10-26 03:33:18,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:33:18,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:33:18,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:33:18,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:33:18,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:33:18,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:33:18,702 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:33:18,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 37.8) internal successors, (189), 6 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:33:18,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:18,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:18,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:18,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:18,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:18,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:18,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:18,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:33:27,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:27,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:27,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:27,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:27,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:27,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:27,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:27,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:27,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-26 03:33:27,101 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr8ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-26 03:33:27,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:33:27,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1137416192, now seen corresponding path program 1 times [2024-10-26 03:33:27,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:33:27,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595825439] [2024-10-26 03:33:27,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:33:27,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:33:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:33:27,844 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:33:27,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:33:27,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595825439] [2024-10-26 03:33:27,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595825439] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:33:27,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098055396] [2024-10-26 03:33:27,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:33:27,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:33:27,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:33:27,846 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:33:27,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-26 03:33:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:33:28,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-26 03:33:28,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:33:28,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-26 03:33:28,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-26 03:33:28,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:33:28,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-10-26 03:33:28,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:33:28,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-10-26 03:33:28,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:33:28,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:33:28,533 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:33:28,533 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:33:28,547 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5525 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_5525) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_5525 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_5525) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_5525 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_5525) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (forall ((v_ArrVal_5525 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_5525) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) is different from false [2024-10-26 03:33:28,612 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)))) (and (forall ((v_ArrVal_5525 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_5525) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (forall ((v_ArrVal_5525 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_5525) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of2ForFork0_#t~nondet49#1|)) (forall ((v_ArrVal_5525 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_5525) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1))) (forall ((v_ArrVal_5525 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_5525) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|))))))) is different from false [2024-10-26 03:33:28,627 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (.cse2 (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (store (select |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|) .cse2 |c_t_funThread1of2ForFork0_#t~nondet49#1|)))) (and (forall ((v_ArrVal_5525 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_5525) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_5525 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_5525) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1))) (forall ((v_ArrVal_5525 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_5525) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse2))) (forall ((v_ArrVal_5525 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_5525) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|)))))) is different from false [2024-10-26 03:33:30,785 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-26 03:33:30,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098055396] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:33:30,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:33:30,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-10-26 03:33:30,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176961291] [2024-10-26 03:33:30,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:33:30,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-26 03:33:30,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:33:30,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-26 03:33:30,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=235, Unknown=3, NotChecked=102, Total=420 [2024-10-26 03:33:30,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:33:30,787 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:33:30,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 16.85) internal successors, (337), 21 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:33:30,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:30,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:30,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:30,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:30,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:30,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:30,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:30,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:30,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:33:30,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2024-10-26 03:33:30,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2024-10-26 03:33:37,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:37,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:37,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:37,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:37,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:37,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:37,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:37,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:37,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:33:37,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-26 03:33:38,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-10-26 03:33:38,092 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr8ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-26 03:33:38,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:33:38,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1513541754, now seen corresponding path program 1 times [2024-10-26 03:33:38,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:33:38,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492223726] [2024-10-26 03:33:38,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:33:38,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:33:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:33:38,520 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-26 03:33:38,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:33:38,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492223726] [2024-10-26 03:33:38,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492223726] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:33:38,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:33:38,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-26 03:33:38,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172702514] [2024-10-26 03:33:38,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:33:38,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:33:38,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:33:38,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:33:38,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:33:38,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:33:38,523 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:33:38,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.833333333333336) internal successors, (209), 6 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:33:38,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:38,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:38,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:38,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:38,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:38,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:38,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:38,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:38,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:33:38,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:33:45,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:45,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:45,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:45,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:45,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:45,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:45,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:45,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:45,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:33:45,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:45,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-26 03:33:45,505 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr8ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-26 03:33:45,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:33:45,505 INFO L85 PathProgramCache]: Analyzing trace with hash 251180490, now seen corresponding path program 1 times [2024-10-26 03:33:45,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:33:45,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365505312] [2024-10-26 03:33:45,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:33:45,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:33:45,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:33:46,742 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-26 03:33:46,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:33:46,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365505312] [2024-10-26 03:33:46,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365505312] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:33:46,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892442537] [2024-10-26 03:33:46,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:33:46,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:33:46,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:33:46,744 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:33:46,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-26 03:33:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:33:47,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-26 03:33:47,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:33:47,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-26 03:33:47,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-26 03:33:47,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-26 03:33:47,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:33:47,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-10-26 03:33:47,543 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:33:47,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-10-26 03:33:47,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:33:47,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:33:47,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:33:47,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:33:47,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:33:47,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:33:47,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:33:47,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:33:47,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:33:47,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:33:47,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:33:47,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:33:47,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:33:47,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:33:47,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:33:47,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:33:47,931 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:33:47,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-26 03:33:48,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:33:48,008 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:33:48,008 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:33:48,021 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6224 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_6224) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) |c_t_funThread1of2ForFork0_#t~nondet49#1|)) (forall ((v_ArrVal_6224 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_6224) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_6224 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_6224) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_6224 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_6224) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) is different from false [2024-10-26 03:33:48,046 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6224 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_6224) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_6224 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_6224) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_6224 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_6224) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_6224 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_6224) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) is different from false [2024-10-26 03:33:48,061 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6224 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_6224) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_6224 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_6224) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (forall ((v_ArrVal_6224 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_6224) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_6224 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_6224) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) |c_t_funThread1of2ForFork0_#t~nondet49#1|))) is different from false [2024-10-26 03:33:53,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:33:53,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 54 [2024-10-26 03:33:53,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:33:53,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 192 treesize of output 122 [2024-10-26 03:33:53,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-10-26 03:33:53,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-26 03:33:53,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:33:53,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2024-10-26 03:33:53,300 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:33:53,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:33:53,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 30 [2024-10-26 03:33:53,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:33:53,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 54 [2024-10-26 03:33:53,316 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:33:53,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:33:53,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 32 [2024-10-26 03:33:53,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:33:53,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 54 [2024-10-26 03:33:53,333 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:33:53,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:33:53,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 32 [2024-10-26 03:33:59,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-26 03:33:59,965 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:33:59,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892442537] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:33:59,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:33:59,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 34 [2024-10-26 03:33:59,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141626155] [2024-10-26 03:33:59,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:33:59,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-26 03:33:59,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:33:59,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-26 03:33:59,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=811, Unknown=40, NotChecked=186, Total=1190 [2024-10-26 03:33:59,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:33:59,968 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:33:59,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 14.764705882352942) internal successors, (502), 35 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:33:59,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:59,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:59,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:59,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:59,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:59,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:59,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:59,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:59,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:33:59,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:59,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:34:08,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:08,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:08,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:08,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:08,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:08,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:08,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:08,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:08,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:34:08,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:08,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:34:08,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-26 03:34:08,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:34:08,824 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr8ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-26 03:34:08,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:34:08,825 INFO L85 PathProgramCache]: Analyzing trace with hash -242594152, now seen corresponding path program 1 times [2024-10-26 03:34:08,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:34:08,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97385150] [2024-10-26 03:34:08,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:34:08,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:34:08,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:34:11,007 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-26 03:34:11,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:34:11,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97385150] [2024-10-26 03:34:11,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97385150] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:34:11,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004274320] [2024-10-26 03:34:11,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:34:11,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:34:11,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:34:11,009 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:34:11,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-26 03:34:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:34:11,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-10-26 03:34:11,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:34:11,529 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-26 03:34:11,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-26 03:34:11,619 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-26 03:34:11,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-26 03:34:11,711 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-26 03:34:11,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2024-10-26 03:34:12,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-26 03:34:12,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-26 03:34:12,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:34:12,918 INFO L378 Elim1Store]: Elim1 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 30 treesize of output 32 [2024-10-26 03:34:12,990 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:34:12,990 INFO L378 Elim1Store]: Elim1 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 39 treesize of output 44 [2024-10-26 03:34:13,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:34:13,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:34:13,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:34:13,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:34:13,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:34:13,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:34:13,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:34:13,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:34:13,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:34:13,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:34:13,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:34:13,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:34:13,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:34:13,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:34:13,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:34:13,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:34:13,901 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2024-10-26 03:34:13,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2024-10-26 03:34:14,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:34:14,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:34:14,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:34:14,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:34:14,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:34:14,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:34:14,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:34:14,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:34:14,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:34:14,662 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:34:14,662 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:34:14,675 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6754 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_~list#1.base| v_ArrVal_6754) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (forall ((v_ArrVal_6754 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_~list#1.base| v_ArrVal_6754) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_6754 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_~list#1.base| v_ArrVal_6754) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_6754 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_~list#1.base| v_ArrVal_6754) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) |c_t_funThread1of2ForFork0_#t~nondet49#1|))) is different from false [2024-10-26 03:34:14,690 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6754 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_6754) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) |c_t_funThread1of2ForFork0_#t~nondet49#1|)) (forall ((v_ArrVal_6754 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_6754) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_6754 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_6754) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (forall ((v_ArrVal_6754 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_6754) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) is different from false [2024-10-26 03:34:14,710 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6754 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_~#A~0.base| v_ArrVal_6754) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (forall ((v_ArrVal_6754 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_~#A~0.base| v_ArrVal_6754) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_6754 (Array Int Int))) (= (select (select (store |c_#race| |c_~#A~0.base| v_ArrVal_6754) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) |c_t_funThread1of2ForFork0_#t~nondet49#1|)) (forall ((v_ArrVal_6754 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_~#A~0.base| v_ArrVal_6754) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1))))) is different from false [2024-10-26 03:34:14,776 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6753 (Array Int Int)) (v_ArrVal_6754 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_6753) |c_~#A~0.base| v_ArrVal_6754) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of2ForFork0_#t~nondet49#1|)) (forall ((v_ArrVal_6753 (Array Int Int)) (v_ArrVal_6754 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_6753) |c_~#A~0.base| v_ArrVal_6754) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_6753 (Array Int Int)) (v_ArrVal_6754 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_6753) |c_~#A~0.base| v_ArrVal_6754) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) |c_t_funThread1of2ForFork0_#t~nondet49#1|)) (forall ((v_ArrVal_6753 (Array Int Int)) (v_ArrVal_6754 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_6753) |c_~#A~0.base| v_ArrVal_6754) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) is different from false [2024-10-26 03:34:14,932 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6753 (Array Int Int)) (v_ArrVal_6754 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_6753) |c_~#A~0.base| v_ArrVal_6754) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_6753 (Array Int Int)) (v_ArrVal_6754 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_6753) |c_~#A~0.base| v_ArrVal_6754) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_6753 (Array Int Int)) (v_ArrVal_6754 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_6753) |c_~#A~0.base| v_ArrVal_6754) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (forall ((v_ArrVal_6753 (Array Int Int)) (v_ArrVal_6754 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_6753) |c_~#A~0.base| v_ArrVal_6754) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) is different from false [2024-10-26 03:34:15,068 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6753 (Array Int Int)) (v_ArrVal_6754 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_6753) |c_~#A~0.base| v_ArrVal_6754) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (forall ((v_ArrVal_6753 (Array Int Int)) (v_ArrVal_6754 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_6753) |c_~#A~0.base| v_ArrVal_6754) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_6753 (Array Int Int)) (v_ArrVal_6754 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_6753) |c_~#A~0.base| v_ArrVal_6754) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_6753 (Array Int Int)) (v_ArrVal_6754 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_6753) |c_~#A~0.base| v_ArrVal_6754) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) is different from false [2024-10-26 03:34:16,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:34:16,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 57 [2024-10-26 03:34:16,173 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:34:16,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 408 treesize of output 266 [2024-10-26 03:34:16,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2024-10-26 03:34:16,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2024-10-26 03:34:16,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 86 [2024-10-26 03:34:16,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:34:16,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 55 [2024-10-26 03:34:16,240 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:34:16,243 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:34:16,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 122 treesize of output 60 [2024-10-26 03:34:16,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-10-26 03:34:16,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2024-10-26 03:34:16,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:34:16,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 57 [2024-10-26 03:34:16,280 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:34:16,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:34:16,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 130 [2024-10-26 03:34:16,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-26 03:34:16,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-10-26 03:34:16,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:34:16,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 57 [2024-10-26 03:34:16,320 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:34:16,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:34:16,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 130 treesize of output 66 [2024-10-26 03:34:16,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2024-10-26 03:34:16,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2024-10-26 03:34:23,219 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:34:23,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004274320] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:34:23,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:34:23,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 19] total 58 [2024-10-26 03:34:23,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77049289] [2024-10-26 03:34:23,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:34:23,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-10-26 03:34:23,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:34:23,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-10-26 03:34:23,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=2454, Unknown=52, NotChecked=642, Total=3422 [2024-10-26 03:34:23,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:34:23,224 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:34:23,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 10.706896551724139) internal successors, (621), 59 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:34:23,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:23,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:23,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:23,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:23,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:23,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:23,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:23,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:23,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:34:23,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:23,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:34:23,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:34:30,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:30,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:30,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:30,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:30,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:30,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:30,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:30,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:30,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:34:30,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:30,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:34:30,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-26 03:34:30,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-10-26 03:34:30,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:34:30,697 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr8ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-26 03:34:30,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:34:30,697 INFO L85 PathProgramCache]: Analyzing trace with hash 682830137, now seen corresponding path program 1 times [2024-10-26 03:34:30,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:34:30,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515263264] [2024-10-26 03:34:30,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:34:30,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:34:30,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:34:32,894 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-26 03:34:32,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:34:32,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515263264] [2024-10-26 03:34:32,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515263264] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:34:32,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040041930] [2024-10-26 03:34:32,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:34:32,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:34:32,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:34:32,897 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:34:32,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-26 03:34:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:34:33,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 93 conjuncts are in the unsatisfiable core [2024-10-26 03:34:33,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:34:33,456 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-26 03:34:33,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-26 03:34:33,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-26 03:34:33,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-26 03:34:33,670 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-26 03:34:33,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-26 03:34:33,809 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-26 03:34:33,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2024-10-26 03:34:35,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-26 03:34:35,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-26 03:34:35,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:34:35,124 INFO L378 Elim1Store]: Elim1 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 30 treesize of output 32 [2024-10-26 03:34:35,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:34:35,188 INFO L378 Elim1Store]: Elim1 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 39 treesize of output 44 [2024-10-26 03:34:35,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:34:35,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:34:35,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:34:35,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:34:35,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:34:35,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:34:35,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:34:35,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:34:35,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:34:35,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:34:35,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:34:35,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:34:35,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:34:35,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:34:35,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:34:35,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:34:35,885 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2024-10-26 03:34:35,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2024-10-26 03:34:36,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:34:36,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:34:36,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:34:36,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:34:36,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:34:36,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:34:36,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:34:36,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:34:36,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:34:36,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:34:36,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:34:36,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:34:36,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:34:37,006 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:34:37,006 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:34:37,031 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7318 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_7318) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (forall ((v_ArrVal_7318 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_7318) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_7318 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_7318) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) |c_t_funThread1of2ForFork0_#t~nondet49#1|)) (forall ((v_ArrVal_7318 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_7318) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) is different from false [2024-10-26 03:34:37,328 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7318 (Array Int Int)) (v_ArrVal_7317 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_7317) |c_t_funThread2of2ForFork0_insert_#in~p#1.base| v_ArrVal_7318) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (forall ((v_ArrVal_7318 (Array Int Int)) (v_ArrVal_7317 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_7317) |c_t_funThread2of2ForFork0_insert_#in~p#1.base| v_ArrVal_7318) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_7318 (Array Int Int)) (v_ArrVal_7317 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_7317) |c_t_funThread2of2ForFork0_insert_#in~p#1.base| v_ArrVal_7318) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_7318 (Array Int Int)) (v_ArrVal_7317 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_7317) |c_t_funThread2of2ForFork0_insert_#in~p#1.base| v_ArrVal_7318) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1))))) is different from false [2024-10-26 03:34:37,345 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7318 (Array Int Int)) (v_ArrVal_7317 (Array Int Int))) (= (select (select (store (store |c_#race| |c_~#A~0.base| v_ArrVal_7317) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_7318) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) |c_t_funThread1of2ForFork0_#t~nondet49#1|)) (forall ((v_ArrVal_7318 (Array Int Int)) (v_ArrVal_7317 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_~#A~0.base| v_ArrVal_7317) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_7318) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_7318 (Array Int Int)) (v_ArrVal_7317 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_~#A~0.base| v_ArrVal_7317) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_7318) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_7318 (Array Int Int)) (v_ArrVal_7317 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_~#A~0.base| v_ArrVal_7317) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_7318) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) is different from false [2024-10-26 03:34:37,787 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7318 (Array Int Int)) (v_ArrVal_7317 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_~#A~0.base| v_ArrVal_7317) |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_7318) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_7318 (Array Int Int)) (v_ArrVal_7317 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_~#A~0.base| v_ArrVal_7317) |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_7318) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_7318 (Array Int Int)) (v_ArrVal_7317 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_~#A~0.base| v_ArrVal_7317) |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_7318) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (forall ((v_ArrVal_7318 (Array Int Int)) (v_ArrVal_7317 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_~#A~0.base| v_ArrVal_7317) |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_7318) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) is different from false [2024-10-26 03:34:38,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:34:38,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 57 [2024-10-26 03:34:38,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:34:38,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 408 treesize of output 266 [2024-10-26 03:34:38,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2024-10-26 03:34:38,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 94 [2024-10-26 03:34:38,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2024-10-26 03:34:38,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:34:38,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 57 [2024-10-26 03:34:39,000 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:34:39,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:34:39,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 192 treesize of output 122 [2024-10-26 03:34:39,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-26 03:34:39,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-10-26 03:34:39,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:34:39,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 55 [2024-10-26 03:34:39,030 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:34:39,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:34:39,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 122 treesize of output 60 [2024-10-26 03:34:39,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-10-26 03:34:39,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2024-10-26 03:34:39,058 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:34:39,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 57 [2024-10-26 03:34:39,061 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:34:39,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:34:39,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 130 treesize of output 66 [2024-10-26 03:34:39,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2024-10-26 03:34:39,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-10-26 03:34:44,067 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:34:44,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040041930] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:34:44,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:34:44,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 28, 20] total 64 [2024-10-26 03:34:44,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851226684] [2024-10-26 03:34:44,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:34:44,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-10-26 03:34:44,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:34:44,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-10-26 03:34:44,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=3219, Unknown=170, NotChecked=484, Total=4160 [2024-10-26 03:34:44,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:34:44,072 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:34:44,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 10.515625) internal successors, (673), 65 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:34:44,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:44,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:44,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:44,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:44,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:44,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:44,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:44,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:44,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:34:44,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:44,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:34:44,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-10-26 03:34:44,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:34:57,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:57,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:57,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:57,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:57,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:57,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:57,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:57,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:57,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:34:57,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:57,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:34:57,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-26 03:34:57,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-26 03:34:57,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-10-26 03:34:58,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-10-26 03:34:58,125 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr8ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-26 03:34:58,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:34:58,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1092361879, now seen corresponding path program 1 times [2024-10-26 03:34:58,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:34:58,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710946112] [2024-10-26 03:34:58,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:34:58,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:34:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:34:58,330 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:34:58,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:34:58,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710946112] [2024-10-26 03:34:58,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710946112] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:34:58,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728568796] [2024-10-26 03:34:58,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:34:58,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:34:58,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:34:58,333 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:34:58,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-26 03:34:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:34:58,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 845 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-26 03:34:58,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:34:58,921 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:34:58,922 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:34:59,061 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:34:59,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728568796] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:34:59,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:34:59,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-10-26 03:34:59,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998982471] [2024-10-26 03:34:59,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:34:59,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-26 03:34:59,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:34:59,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-26 03:34:59,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-10-26 03:34:59,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:34:59,064 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:34:59,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 33.42857142857143) internal successors, (468), 14 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:34:59,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:59,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:59,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:59,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:59,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:59,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:59,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:59,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:59,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:34:59,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:34:59,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:34:59,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-10-26 03:34:59,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-26 03:34:59,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:35:01,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:01,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:01,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:01,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:01,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:01,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:01,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:01,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:01,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:35:01,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:01,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:35:01,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-26 03:35:01,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-26 03:35:01,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:35:01,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-10-26 03:35:01,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-10-26 03:35:01,375 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr8ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-26 03:35:01,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:35:01,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1532964668, now seen corresponding path program 2 times [2024-10-26 03:35:01,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:35:01,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935042861] [2024-10-26 03:35:01,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:35:01,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:35:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:35:02,514 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-26 03:35:02,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:35:02,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935042861] [2024-10-26 03:35:02,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935042861] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:35:02,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950555358] [2024-10-26 03:35:02,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 03:35:02,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:35:02,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:35:02,516 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:35:02,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-26 03:35:03,469 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 03:35:03,469 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 03:35:03,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-26 03:35:03,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:35:03,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-26 03:35:04,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-26 03:35:04,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-26 03:35:04,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-10-26 03:35:04,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:35:04,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 03:35:04,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:35:04,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 03:35:04,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:35:04,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 03:35:04,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:35:04,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 03:35:04,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:35:04,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 03:35:04,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:35:04,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 03:35:04,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:35:04,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 03:35:04,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:35:04,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 03:35:04,439 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:35:04,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-26 03:35:04,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 03:35:04,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:35:04,633 INFO L378 Elim1Store]: Elim1 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 33 treesize of output 38 [2024-10-26 03:35:04,673 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:35:04,673 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:35:04,698 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_8216 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_8216) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_8216 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_8216) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_8216 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_8216) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) is different from false [2024-10-26 03:35:04,800 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_8216 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_8216) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (forall ((v_ArrVal_8216 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_8216) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_8216 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_8216) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) is different from false [2024-10-26 03:35:04,812 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_8216 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_8216) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_8216 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_8216) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of2ForFork0_#t~nondet49#1|)) (forall ((v_ArrVal_8216 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_8216) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) |c_t_funThread1of2ForFork0_#t~nondet49#1|))) is different from false [2024-10-26 03:35:13,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:35:13,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 44 [2024-10-26 03:35:13,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:35:13,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 176 treesize of output 118 [2024-10-26 03:35:13,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-26 03:35:13,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-10-26 03:35:13,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:35:13,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 44 [2024-10-26 03:35:13,038 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:35:13,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:35:13,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 24 [2024-10-26 03:35:13,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:35:13,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 42 [2024-10-26 03:35:13,052 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:35:13,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:35:13,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 22 [2024-10-26 03:35:15,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-26 03:35:16,030 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:35:16,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950555358] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:35:16,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:35:16,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 38 [2024-10-26 03:35:16,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905432116] [2024-10-26 03:35:16,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:35:16,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-26 03:35:16,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:35:16,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-26 03:35:16,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1080, Unknown=34, NotChecked=210, Total=1482 [2024-10-26 03:35:16,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:35:16,034 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:35:16,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 13.447368421052632) internal successors, (511), 39 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:35:16,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:16,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:16,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:16,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:16,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:16,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:16,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:16,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:16,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:35:16,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:16,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:35:16,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-10-26 03:35:16,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-26 03:35:16,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:35:16,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:35:20,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:20,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:20,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:20,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:20,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:20,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:20,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:20,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:20,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:35:20,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:20,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:35:20,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-26 03:35:20,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-26 03:35:20,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:35:20,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-26 03:35:20,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-10-26 03:35:20,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-10-26 03:35:20,268 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr8ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-26 03:35:20,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:35:20,269 INFO L85 PathProgramCache]: Analyzing trace with hash 127751398, now seen corresponding path program 2 times [2024-10-26 03:35:20,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:35:20,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726493981] [2024-10-26 03:35:20,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:35:20,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:35:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:35:22,166 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-26 03:35:22,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:35:22,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726493981] [2024-10-26 03:35:22,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726493981] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:35:22,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143600186] [2024-10-26 03:35:22,167 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 03:35:22,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:35:22,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:35:22,168 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:35:22,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-10-26 03:35:23,555 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 03:35:23,556 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 03:35:23,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-10-26 03:35:23,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:35:23,666 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-26 03:35:23,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-26 03:35:23,809 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-26 03:35:23,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-26 03:35:23,949 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-10-26 03:35:23,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2024-10-26 03:35:25,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-26 03:35:25,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-26 03:35:25,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2024-10-26 03:35:26,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-10-26 03:35:26,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-10-26 03:35:26,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-10-26 03:35:26,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-10-26 03:35:26,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-10-26 03:35:26,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-10-26 03:35:26,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-10-26 03:35:26,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-10-26 03:35:26,576 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-10-26 03:35:26,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2024-10-26 03:35:26,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-10-26 03:35:26,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2024-10-26 03:35:26,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:35:26,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:35:27,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:35:27,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:35:27,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:35:27,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:35:27,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-10-26 03:35:27,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2024-10-26 03:35:27,480 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:35:27,480 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:35:28,218 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_8746 (Array Int Int)) (v_ArrVal_8748 Int) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_46| Int)) (or (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (let ((.cse0 (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_8746))) (store .cse0 |c_~#A~0.base| (store (select .cse0 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_46| v_ArrVal_8748))) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_46|))) (forall ((v_ArrVal_8746 (Array Int Int)) (v_ArrVal_8748 Int) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_46| Int)) (or (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (let ((.cse1 (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_8746))) (store .cse1 |c_~#A~0.base| (store (select .cse1 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_46| v_ArrVal_8748))) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_46|))) (forall ((v_ArrVal_8746 (Array Int Int)) (v_ArrVal_8748 Int) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_46| Int)) (or (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (let ((.cse2 (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_8746))) (store .cse2 |c_~#A~0.base| (store (select .cse2 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_46| v_ArrVal_8748))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_46|))) (forall ((v_ArrVal_8746 (Array Int Int)) (v_ArrVal_8748 Int) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_46| Int)) (or (= (select (select (let ((.cse3 (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_8746))) (store .cse3 |c_~#A~0.base| (store (select .cse3 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_46| v_ArrVal_8748))) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of2ForFork0_#t~nondet49#1|) (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_46|)))) is different from false [2024-10-26 03:35:28,489 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (let ((.cse1 (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse4 |c_t_funThread1of2ForFork0_#t~nondet49#1|)))) (and (forall ((v_ArrVal_8746 (Array Int Int)) (v_ArrVal_8748 Int) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_46| Int)) (or (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (let ((.cse0 (store .cse1 |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_8746))) (store .cse0 |c_~#A~0.base| (store (select .cse0 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_46| v_ArrVal_8748))) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_46|))) (forall ((v_ArrVal_8746 (Array Int Int)) (v_ArrVal_8748 Int) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_46| Int)) (or (= (select (select (let ((.cse2 (store .cse1 |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_8746))) (store .cse2 |c_~#A~0.base| (store (select .cse2 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_46| v_ArrVal_8748))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) |c_t_funThread1of2ForFork0_#t~nondet49#1|) (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_46|))) (forall ((v_ArrVal_8746 (Array Int Int)) (v_ArrVal_8748 Int) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_46| Int)) (or (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (let ((.cse3 (store .cse1 |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_8746))) (store .cse3 |c_~#A~0.base| (store (select .cse3 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_46| v_ArrVal_8748))) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse4)) (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_46|))) (forall ((v_ArrVal_8746 (Array Int Int)) (v_ArrVal_8748 Int) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_46| Int)) (or (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (let ((.cse5 (store .cse1 |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_8746))) (store .cse5 |c_~#A~0.base| (store (select .cse5 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_46| v_ArrVal_8748))) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1))) (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_46|)))))) is different from false [2024-10-26 03:35:28,533 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (and (forall ((v_ArrVal_8746 (Array Int Int)) (v_ArrVal_8748 Int) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_46| Int) (v_ArrVal_8737 (Array Int Int))) (or (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (let ((.cse0 (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_8737) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_8746))) (store .cse0 |c_~#A~0.base| (store (select .cse0 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_46| v_ArrVal_8748))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_46|))) (forall ((v_ArrVal_8746 (Array Int Int)) (v_ArrVal_8748 Int) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_46| Int) (v_ArrVal_8737 (Array Int Int))) (or (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (let ((.cse2 (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_8737) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_8746))) (store .cse2 |c_~#A~0.base| (store (select .cse2 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_46| v_ArrVal_8748))) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1))) (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_46|))) (forall ((v_ArrVal_8746 (Array Int Int)) (v_ArrVal_8748 Int) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_46| Int) (v_ArrVal_8737 (Array Int Int))) (or (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (let ((.cse3 (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_8737) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_8746))) (store .cse3 |c_~#A~0.base| (store (select .cse3 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_46| v_ArrVal_8748))) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_46|))) (forall ((v_ArrVal_8746 (Array Int Int)) (v_ArrVal_8748 Int) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_46| Int) (v_ArrVal_8737 (Array Int Int))) (or (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (let ((.cse4 (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_8737) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_8746))) (store .cse4 |c_~#A~0.base| (store (select .cse4 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_46| v_ArrVal_8748))) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1)) (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_46|))))) is different from false [2024-10-26 03:35:28,642 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (and (forall ((v_ArrVal_8746 (Array Int Int)) (v_ArrVal_8748 Int) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_46| Int) (v_ArrVal_8737 (Array Int Int))) (or (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (let ((.cse0 (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_8737) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_8746))) (store .cse0 |c_~#A~0.base| (store (select .cse0 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_46| v_ArrVal_8748))) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1))) (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_46|))) (forall ((v_ArrVal_8746 (Array Int Int)) (v_ArrVal_8748 Int) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_46| Int) (v_ArrVal_8737 (Array Int Int))) (or (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (let ((.cse2 (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_8737) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_8746))) (store .cse2 |c_~#A~0.base| (store (select .cse2 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_46| v_ArrVal_8748))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_46|))) (forall ((v_ArrVal_8746 (Array Int Int)) (v_ArrVal_8748 Int) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_46| Int) (v_ArrVal_8737 (Array Int Int))) (or (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (let ((.cse3 (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_8737) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_8746))) (store .cse3 |c_~#A~0.base| (store (select .cse3 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_46| v_ArrVal_8748))) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1)) (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_46|))) (forall ((v_ArrVal_8746 (Array Int Int)) (v_ArrVal_8748 Int) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_46| Int) (v_ArrVal_8737 (Array Int Int))) (or (= (select (select (let ((.cse4 (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_8737) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_8746))) (store .cse4 |c_~#A~0.base| (store (select .cse4 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_46| v_ArrVal_8748))) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) |c_t_funThread1of2ForFork0_#t~nondet49#1|) (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_46|))))) is different from false [2024-10-26 03:35:28,700 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (and (forall ((v_ArrVal_8746 (Array Int Int)) (v_ArrVal_8748 Int) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_46| Int) (v_ArrVal_8737 (Array Int Int))) (or (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (let ((.cse0 (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_8737) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_8746))) (store .cse0 |c_~#A~0.base| (store (select .cse0 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_46| v_ArrVal_8748))) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1))) (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_46|))) (forall ((v_ArrVal_8746 (Array Int Int)) (v_ArrVal_8748 Int) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_46| Int) (v_ArrVal_8737 (Array Int Int))) (or (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (let ((.cse2 (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_8737) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_8746))) (store .cse2 |c_~#A~0.base| (store (select .cse2 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_46| v_ArrVal_8748))) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1)) (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_46|))) (forall ((v_ArrVal_8746 (Array Int Int)) (v_ArrVal_8748 Int) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_46| Int) (v_ArrVal_8737 (Array Int Int))) (or (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (let ((.cse3 (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_8737) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_8746))) (store .cse3 |c_~#A~0.base| (store (select .cse3 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_46| v_ArrVal_8748))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_46|))) (forall ((v_ArrVal_8746 (Array Int Int)) (v_ArrVal_8748 Int) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_46| Int) (v_ArrVal_8737 (Array Int Int))) (or (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (let ((.cse4 (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_8737) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_8746))) (store .cse4 |c_~#A~0.base| (store (select .cse4 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_46| v_ArrVal_8748))) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_46|))))) is different from false [2024-10-26 03:35:28,756 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (and (forall ((v_ArrVal_8746 (Array Int Int)) (v_ArrVal_8748 Int) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_46| Int) (v_ArrVal_8737 (Array Int Int))) (or (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (let ((.cse0 (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_8737) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_8746))) (store .cse0 |c_~#A~0.base| (store (select .cse0 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_46| v_ArrVal_8748))) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1)) (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_46|))) (forall ((v_ArrVal_8746 (Array Int Int)) (v_ArrVal_8748 Int) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_46| Int) (v_ArrVal_8737 (Array Int Int))) (or (= (select (select (let ((.cse2 (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_8737) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_8746))) (store .cse2 |c_~#A~0.base| (store (select .cse2 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_46| v_ArrVal_8748))) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of2ForFork0_#t~nondet49#1|) (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_46|))) (forall ((v_ArrVal_8746 (Array Int Int)) (v_ArrVal_8748 Int) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_46| Int) (v_ArrVal_8737 (Array Int Int))) (or (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (let ((.cse3 (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_8737) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_8746))) (store .cse3 |c_~#A~0.base| (store (select .cse3 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_46| v_ArrVal_8748))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_46|))) (forall ((v_ArrVal_8746 (Array Int Int)) (v_ArrVal_8748 Int) (|v_t_funThread2of2ForFork0_insert_~list#1.offset_46| Int) (v_ArrVal_8737 (Array Int Int))) (or (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (let ((.cse4 (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_8737) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_8746))) (store .cse4 |c_~#A~0.base| (store (select .cse4 |c_~#A~0.base|) |v_t_funThread2of2ForFork0_insert_~list#1.offset_46| v_ArrVal_8748))) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (< |c_~#A~0.offset| |v_t_funThread2of2ForFork0_insert_~list#1.offset_46|))))) is different from false [2024-10-26 03:35:31,899 INFO L349 Elim1Store]: treesize reduction 23, result has 62.9 percent of original size [2024-10-26 03:35:31,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 2638 treesize of output 2056 [2024-10-26 03:35:31,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:35:31,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1130 treesize of output 1000 [2024-10-26 03:35:31,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 564 treesize of output 552 [2024-10-26 03:35:31,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 572 treesize of output 564 [2024-10-26 03:35:31,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 620 treesize of output 604 [2024-10-26 03:35:32,385 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:35:32,398 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:35:32,421 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:35:32,445 INFO L349 Elim1Store]: treesize reduction 23, result has 62.9 percent of original size [2024-10-26 03:35:32,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1126 treesize of output 800 [2024-10-26 03:35:32,458 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:35:32,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:35:32,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 370 treesize of output 336 [2024-10-26 03:35:32,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 310 treesize of output 302 [2024-10-26 03:35:32,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 320 treesize of output 296 [2024-10-26 03:35:32,655 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:35:32,687 INFO L349 Elim1Store]: treesize reduction 23, result has 62.9 percent of original size [2024-10-26 03:35:32,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1126 treesize of output 800 [2024-10-26 03:35:32,699 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:35:32,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:35:32,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 434 treesize of output 384 [2024-10-26 03:35:32,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 374 treesize of output 366 [2024-10-26 03:35:32,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 384 treesize of output 360 [2024-10-26 03:35:32,957 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:35:32,982 INFO L349 Elim1Store]: treesize reduction 38, result has 38.7 percent of original size [2024-10-26 03:35:32,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 582 treesize of output 529 [2024-10-26 03:35:32,993 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:35:33,002 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:35:33,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 249 treesize of output 221 [2024-10-26 03:35:33,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 146 [2024-10-26 03:35:39,070 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:35:39,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143600186] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:35:39,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:35:39,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 20] total 60 [2024-10-26 03:35:39,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492899021] [2024-10-26 03:35:39,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:35:39,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2024-10-26 03:35:39,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:35:39,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2024-10-26 03:35:39,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=2681, Unknown=18, NotChecked=666, Total=3660 [2024-10-26 03:35:39,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:35:39,077 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:35:39,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 11.516666666666667) internal successors, (691), 61 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:35:39,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:39,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:39,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:39,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:39,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:39,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:39,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:39,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:39,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:35:39,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:39,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:35:39,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-10-26 03:35:39,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-26 03:35:39,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:35:39,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-10-26 03:35:39,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:35:52,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:52,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:52,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:52,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:52,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:52,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:52,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:52,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:52,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:35:52,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:35:52,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:35:52,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-26 03:35:52,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-26 03:35:52,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:35:52,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-26 03:35:52,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-26 03:35:52,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-10-26 03:35:52,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-10-26 03:35:52,572 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr8ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-26 03:35:52,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:35:52,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1796665557, now seen corresponding path program 2 times [2024-10-26 03:35:52,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:35:52,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485025308] [2024-10-26 03:35:52,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:35:52,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:35:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:35:54,604 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-26 03:35:54,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:35:54,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485025308] [2024-10-26 03:35:54,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485025308] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:35:54,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817803127] [2024-10-26 03:35:54,605 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 03:35:54,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:35:54,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:35:54,608 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:35:54,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-26 03:35:56,924 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 03:35:56,924 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 03:35:56,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-10-26 03:35:56,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:35:57,041 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-26 03:35:57,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-26 03:35:57,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-26 03:35:57,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-26 03:35:57,262 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-26 03:35:57,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-26 03:35:57,365 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-26 03:35:57,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2024-10-26 03:35:58,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-26 03:35:58,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-26 03:35:59,058 INFO L378 Elim1Store]: Elim1 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 26 treesize of output 28 [2024-10-26 03:35:59,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:35:59,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 03:35:59,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:35:59,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 03:35:59,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:35:59,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 03:35:59,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:35:59,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 03:35:59,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:35:59,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 03:35:59,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:35:59,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 03:35:59,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:35:59,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 03:35:59,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:35:59,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 03:35:59,901 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-26 03:35:59,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-10-26 03:36:00,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 03:36:00,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-10-26 03:36:00,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-26 03:36:00,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-26 03:36:00,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-26 03:36:00,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-26 03:36:00,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-26 03:36:00,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-26 03:36:00,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-26 03:36:00,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-26 03:36:00,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-26 03:36:00,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-26 03:36:00,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-26 03:36:01,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-10-26 03:36:01,074 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:36:01,074 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:36:01,088 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_9310 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_9310) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_9310 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_9310) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_9310 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_9310) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (forall ((v_ArrVal_9310 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store |c_#race| |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_9310) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) is different from false [2024-10-26 03:36:01,252 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_9309 (Array Int Int)) (v_ArrVal_9310 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_9309) |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_9310) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_9309 (Array Int Int)) (v_ArrVal_9310 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_9309) |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_9310) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_9309 (Array Int Int)) (v_ArrVal_9310 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_9309) |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_9310) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_9309 (Array Int Int)) (v_ArrVal_9310 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_9309) |c_t_funThread2of2ForFork0_insert_~p#1.base| v_ArrVal_9310) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) |c_t_funThread1of2ForFork0_#t~nondet49#1|))) is different from false [2024-10-26 03:36:01,266 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_9309 (Array Int Int)) (v_ArrVal_9310 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_9309) |c_t_funThread2of2ForFork0_insert_#in~p#1.base| v_ArrVal_9310) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (forall ((v_ArrVal_9309 (Array Int Int)) (v_ArrVal_9310 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_9309) |c_t_funThread2of2ForFork0_insert_#in~p#1.base| v_ArrVal_9310) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) |c_t_funThread1of2ForFork0_#t~nondet49#1|)) (forall ((v_ArrVal_9309 (Array Int Int)) (v_ArrVal_9310 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_9309) |c_t_funThread2of2ForFork0_insert_#in~p#1.base| v_ArrVal_9310) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_9309 (Array Int Int)) (v_ArrVal_9310 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_9309) |c_t_funThread2of2ForFork0_insert_#in~p#1.base| v_ArrVal_9310) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) is different from false [2024-10-26 03:36:01,290 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_9309 (Array Int Int)) (v_ArrVal_9310 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_~#A~0.base| v_ArrVal_9309) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_9310) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (forall ((v_ArrVal_9309 (Array Int Int)) (v_ArrVal_9310 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_~#A~0.base| v_ArrVal_9309) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_9310) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_9309 (Array Int Int)) (v_ArrVal_9310 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_~#A~0.base| v_ArrVal_9309) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_9310) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_9309 (Array Int Int)) (v_ArrVal_9310 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_~#A~0.base| v_ArrVal_9309) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_9310) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1))))) is different from false [2024-10-26 03:36:01,538 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet49#1|)))) (and (forall ((v_ArrVal_9305 (Array Int Int)) (v_ArrVal_9309 (Array Int Int)) (v_ArrVal_9310 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store .cse0 |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_9305) |c_~#A~0.base| v_ArrVal_9309) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_9310) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_9305 (Array Int Int)) (v_ArrVal_9309 (Array Int Int)) (v_ArrVal_9310 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store .cse0 |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_9305) |c_~#A~0.base| v_ArrVal_9309) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_9310) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_9305 (Array Int Int)) (v_ArrVal_9309 (Array Int Int)) (v_ArrVal_9310 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store .cse0 |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_9305) |c_~#A~0.base| v_ArrVal_9309) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_9310) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (forall ((v_ArrVal_9305 (Array Int Int)) (v_ArrVal_9309 (Array Int Int)) (v_ArrVal_9310 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store .cse0 |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_9305) |c_~#A~0.base| v_ArrVal_9309) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_9310) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse1)))))) is different from false [2024-10-26 03:36:01,552 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (and (forall ((v_ArrVal_9305 (Array Int Int)) (v_ArrVal_9309 (Array Int Int)) (v_ArrVal_9310 (Array Int Int)) (v_ArrVal_9297 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_9297) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_9305) |c_~#A~0.base| v_ArrVal_9309) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_9310) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0))) (forall ((v_ArrVal_9305 (Array Int Int)) (v_ArrVal_9309 (Array Int Int)) (v_ArrVal_9310 (Array Int Int)) (v_ArrVal_9297 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_9297) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_9305) |c_~#A~0.base| v_ArrVal_9309) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_9310) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_9305 (Array Int Int)) (v_ArrVal_9309 (Array Int Int)) (v_ArrVal_9310 (Array Int Int)) (v_ArrVal_9297 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_9297) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_9305) |c_~#A~0.base| v_ArrVal_9309) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_9310) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_9305 (Array Int Int)) (v_ArrVal_9309 (Array Int Int)) (v_ArrVal_9310 (Array Int Int)) (v_ArrVal_9297 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_9297) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_9305) |c_~#A~0.base| v_ArrVal_9309) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_9310) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) is different from false [2024-10-26 03:36:01,598 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (and (forall ((v_ArrVal_9305 (Array Int Int)) (v_ArrVal_9309 (Array Int Int)) (v_ArrVal_9310 (Array Int Int)) (v_ArrVal_9297 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_9297) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_9305) |c_~#A~0.base| v_ArrVal_9309) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_9310) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_9305 (Array Int Int)) (v_ArrVal_9309 (Array Int Int)) (v_ArrVal_9310 (Array Int Int)) (v_ArrVal_9297 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_9297) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_9305) |c_~#A~0.base| v_ArrVal_9309) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_9310) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (forall ((v_ArrVal_9305 (Array Int Int)) (v_ArrVal_9309 (Array Int Int)) (v_ArrVal_9310 (Array Int Int)) (v_ArrVal_9297 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_9297) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_9305) |c_~#A~0.base| v_ArrVal_9309) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_9310) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0))) (forall ((v_ArrVal_9305 (Array Int Int)) (v_ArrVal_9309 (Array Int Int)) (v_ArrVal_9310 (Array Int Int)) (v_ArrVal_9297 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_9297) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_t_funThread2of2ForFork0_init_#in~p#1.base| v_ArrVal_9305) |c_~#A~0.base| v_ArrVal_9309) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_9310) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))))) is different from false [2024-10-26 03:36:01,623 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (and (forall ((v_ArrVal_9309 (Array Int Int)) (v_ArrVal_9310 (Array Int Int)) (v_ArrVal_9297 (Array Int Int))) (= (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_9297) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_~#A~0.base| v_ArrVal_9309) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_9310) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of2ForFork0_#t~nondet49#1|)) (forall ((v_ArrVal_9309 (Array Int Int)) (v_ArrVal_9310 (Array Int Int)) (v_ArrVal_9297 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_9297) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_~#A~0.base| v_ArrVal_9309) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_9310) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0))) (forall ((v_ArrVal_9309 (Array Int Int)) (v_ArrVal_9310 (Array Int Int)) (v_ArrVal_9297 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_9297) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_~#A~0.base| v_ArrVal_9309) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_9310) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_9309 (Array Int Int)) (v_ArrVal_9310 (Array Int Int)) (v_ArrVal_9297 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_9297) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_~#A~0.base| v_ArrVal_9309) |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_9310) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) is different from false [2024-10-26 03:36:01,646 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 3 |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (and (forall ((v_ArrVal_9309 (Array Int Int)) (v_ArrVal_9310 (Array Int Int)) (v_ArrVal_9297 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_9297) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_~#A~0.base| v_ArrVal_9309) |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_9310) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (forall ((v_ArrVal_9309 (Array Int Int)) (v_ArrVal_9310 (Array Int Int)) (v_ArrVal_9297 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_9297) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_~#A~0.base| v_ArrVal_9309) |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_9310) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_9309 (Array Int Int)) (v_ArrVal_9310 (Array Int Int)) (v_ArrVal_9297 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_9297) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_~#A~0.base| v_ArrVal_9309) |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_9310) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |c_t_funThread1of2ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_9309 (Array Int Int)) (v_ArrVal_9310 (Array Int Int)) (v_ArrVal_9297 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select (store |c_#race| |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_9297) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0 |c_t_funThread1of2ForFork0_#t~nondet49#1|)) |c_~#A~0.base| v_ArrVal_9309) |c_t_funThread2of2ForFork0_#t~malloc36#1.base| v_ArrVal_9310) |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0))))) is different from false [2024-10-26 03:36:09,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:36:09,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 178 treesize of output 170 [2024-10-26 03:36:09,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:36:09,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 277 treesize of output 177 [2024-10-26 03:36:09,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2024-10-26 03:36:09,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2024-10-26 03:36:09,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-10-26 03:36:09,735 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:36:09,742 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:36:09,748 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:36:09,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 56 [2024-10-26 03:36:09,751 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:36:09,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:36:09,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 37 [2024-10-26 03:36:09,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-10-26 03:36:09,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-10-26 03:36:09,771 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:36:09,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:36:09,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 60 [2024-10-26 03:36:09,781 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:36:09,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:36:09,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 45 [2024-10-26 03:36:09,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-26 03:36:09,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-26 03:36:15,808 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:36:15,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817803127] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:36:15,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:36:15,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 26, 22] total 64 [2024-10-26 03:36:15,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748555633] [2024-10-26 03:36:15,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:36:15,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-10-26 03:36:15,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:36:15,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-10-26 03:36:15,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=2759, Unknown=82, NotChecked=1044, Total=4160 [2024-10-26 03:36:15,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:36:15,812 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:36:15,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 10.59375) internal successors, (678), 65 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 03:36:15,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:36:15,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:36:15,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:36:15,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:36:15,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:36:15,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:36:15,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:36:15,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:36:15,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:36:15,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:36:15,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:36:15,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-10-26 03:36:15,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-26 03:36:15,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:36:15,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-10-26 03:36:15,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-10-26 03:36:15,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:36:30,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:36:30,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:36:30,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:36:30,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:36:30,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:36:30,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:36:30,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:36:30,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:36:30,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 03:36:30,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:36:30,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:36:30,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-26 03:36:30,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-26 03:36:30,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:36:30,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-26 03:36:30,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-26 03:36:30,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-26 03:36:30,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-10-26 03:36:30,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-10-26 03:36:30,522 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr8ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-26 03:36:30,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:36:30,523 INFO L85 PathProgramCache]: Analyzing trace with hash -309219138, now seen corresponding path program 3 times [2024-10-26 03:36:30,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:36:30,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85149229] [2024-10-26 03:36:30,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:36:30,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:36:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:36:32,404 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-26 03:36:32,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:36:32,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85149229] [2024-10-26 03:36:32,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85149229] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:36:32,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930263287] [2024-10-26 03:36:32,404 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-26 03:36:32,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:36:32,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:36:32,406 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 03:36:32,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-10-26 03:36:36,536 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-26 03:36:36,536 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 03:36:36,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 90 conjuncts are in the unsatisfiable core [2024-10-26 03:36:36,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:36:36,661 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-26 03:36:36,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-26 03:36:36,806 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-26 03:36:36,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-26 03:36:37,029 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-26 03:36:37,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2024-10-26 03:36:38,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-26 03:36:39,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-26 03:36:39,181 INFO L378 Elim1Store]: Elim1 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 26 treesize of output 28 [2024-10-26 03:36:39,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:36:39,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2024-10-26 03:36:39,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:36:39,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 45 [2024-10-26 03:36:39,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:36:39,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 45 [2024-10-26 03:36:39,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:36:39,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2024-10-26 03:36:40,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:36:40,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:36:40,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 68 [2024-10-26 03:36:40,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:36:40,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:36:40,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 71 [2024-10-26 03:36:40,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:36:40,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:36:40,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 71 [2024-10-26 03:36:40,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:36:40,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:36:40,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:36:40,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 80 [2024-10-26 03:36:56,968 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2024-10-26 03:36:56,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 129 treesize of output 135 [2024-10-26 03:36:58,036 INFO L349 Elim1Store]: treesize reduction 32, result has 45.8 percent of original size [2024-10-26 03:36:58,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 147 treesize of output 148 [2024-10-26 03:37:06,768 INFO L349 Elim1Store]: treesize reduction 72, result has 54.1 percent of original size [2024-10-26 03:37:06,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 286 treesize of output 321 [2024-10-26 03:37:18,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:37:18,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:37:18,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 7 [2024-10-26 03:37:35,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:37:35,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:37:35,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 7 [2024-10-26 03:37:36,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:37:36,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:37:36,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 7 [2024-10-26 03:38:32,379 WARN L286 SmtUtils]: Spent 19.20s on a formula simplification. DAG size of input: 1731 DAG size of output: 1723 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Killed by 15