./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 c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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-?-c7c6ca5-m [2024-11-13 06:21:19,247 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 06:21:19,316 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2024-11-13 06:21:19,324 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 06:21:19,324 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 06:21:19,347 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 06:21:19,347 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 06:21:19,348 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 06:21:19,348 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 06:21:19,349 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 06:21:19,350 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 06:21:19,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 06:21:19,350 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 06:21:19,350 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 06:21:19,350 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 06:21:19,351 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 06:21:19,351 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 06:21:19,354 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 06:21:19,354 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 06:21:19,354 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 06:21:19,355 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 06:21:19,355 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 06:21:19,355 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-13 06:21:19,355 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 06:21:19,355 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 06:21:19,356 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 06:21:19,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 06:21:19,356 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 06:21:19,356 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 06:21:19,356 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 06:21:19,357 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-11-13 06:21:19,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 06:21:19,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 06:21:19,357 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 06:21:19,357 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 06:21:19,357 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 06:21:19,357 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 06:21:19,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 06:21:19,358 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 06:21:19,358 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-11-13 06:21:19,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-13 06:21:19,359 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-13 06:21:19,359 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-13 06:21:19,359 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-11-13 06:21:19,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 06:21:19,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 06:21:19,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 06:21:19,646 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 06:21:19,647 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 06:21:19,648 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-11-13 06:21:21,166 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 06:21:21,465 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 06:21:21,466 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_94-alloc_region_racing.i [2024-11-13 06:21:21,498 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c5ff1264c/49fc119b7b904edcb658bbd038fc2cb3/FLAG652ae390a [2024-11-13 06:21:21,511 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c5ff1264c/49fc119b7b904edcb658bbd038fc2cb3 [2024-11-13 06:21:21,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 06:21:21,514 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 06:21:21,515 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 06:21:21,515 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 06:21:21,519 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 06:21:21,520 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 06:21:21" (1/1) ... [2024-11-13 06:21:21,520 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14acb12a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:21:21, skipping insertion in model container [2024-11-13 06:21:21,521 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 06:21:21" (1/1) ... [2024-11-13 06:21:21,554 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 06:21:21,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 06:21:22,015 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 06:21:22,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 06:21:22,130 INFO L204 MainTranslator]: Completed translation [2024-11-13 06:21:22,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:21:22 WrapperNode [2024-11-13 06:21:22,131 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 06:21:22,132 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 06:21:22,132 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 06:21:22,132 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 06:21:22,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:21:22" (1/1) ... [2024-11-13 06:21:22,170 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:21:22" (1/1) ... [2024-11-13 06:21:22,216 INFO L138 Inliner]: procedures = 378, calls = 83, calls flagged for inlining = 10, calls inlined = 11, statements flattened = 446 [2024-11-13 06:21:22,216 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 06:21:22,217 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 06:21:22,217 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 06:21:22,217 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 06:21:22,230 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:21:22" (1/1) ... [2024-11-13 06:21:22,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:21:22" (1/1) ... [2024-11-13 06:21:22,240 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:21:22" (1/1) ... [2024-11-13 06:21:22,243 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:21:22" (1/1) ... [2024-11-13 06:21:22,276 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:21:22" (1/1) ... [2024-11-13 06:21:22,281 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:21:22" (1/1) ... [2024-11-13 06:21:22,284 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:21:22" (1/1) ... [2024-11-13 06:21:22,285 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:21:22" (1/1) ... [2024-11-13 06:21:22,290 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 06:21:22,291 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 06:21:22,291 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 06:21:22,291 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 06:21:22,291 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:21:22" (1/1) ... [2024-11-13 06:21:22,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 06:21:22,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:21:22,325 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-11-13 06:21:22,328 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-11-13 06:21:22,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 06:21:22,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-13 06:21:22,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 06:21:22,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-13 06:21:22,368 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-13 06:21:22,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 06:21:22,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 06:21:22,369 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-13 06:21:22,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 06:21:22,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 06:21:22,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-13 06:21:22,369 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-13 06:21:22,370 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-13 06:21:22,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 06:21:22,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 06:21:22,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 06:21:22,372 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 06:21:22,556 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 06:21:22,557 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 06:21:23,279 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 06:21:23,279 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 06:21:23,331 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 06:21:23,331 INFO L316 CfgBuilder]: Removed 23 assume(true) statements. [2024-11-13 06:21:23,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 06:21:23 BoogieIcfgContainer [2024-11-13 06:21:23,332 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 06:21:23,333 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 06:21:23,333 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 06:21:23,336 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 06:21:23,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 06:21:21" (1/3) ... [2024-11-13 06:21:23,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43b3f734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 06:21:23, skipping insertion in model container [2024-11-13 06:21:23,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:21:22" (2/3) ... [2024-11-13 06:21:23,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43b3f734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 06:21:23, skipping insertion in model container [2024-11-13 06:21:23,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 06:21:23" (3/3) ... [2024-11-13 06:21:23,340 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_94-alloc_region_racing.i [2024-11-13 06:21:23,353 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 06:21:23,354 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2024-11-13 06:21:23,354 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 06:21:23,480 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-13 06:21:23,544 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:21:23,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-13 06:21:23,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:21:23,549 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-11-13 06:21:23,554 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-11-13 06:21:23,624 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 06:21:23,637 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-11-13 06:21:23,647 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;@4593bddb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:21:23,647 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-11-13 06:21:24,259 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-11-13 06:21:24,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:21:24,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1692091816, now seen corresponding path program 1 times [2024-11-13 06:21:24,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:21:24,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481742583] [2024-11-13 06:21:24,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:24,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:21:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:25,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:21:25,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:21:25,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481742583] [2024-11-13 06:21:25,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481742583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:21:25,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:21:25,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:21:25,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512633890] [2024-11-13 06:21:25,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:21:25,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:21:25,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:21:25,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:21:25,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:21:25,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:25,230 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:21:25,231 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-11-13 06:21:25,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:25,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:25,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 06:21:25,536 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-11-13 06:21:25,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:21:25,536 INFO L85 PathProgramCache]: Analyzing trace with hash 224964957, now seen corresponding path program 1 times [2024-11-13 06:21:25,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:21:25,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429307730] [2024-11-13 06:21:25,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:25,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:21:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:26,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:21:26,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:21:26,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429307730] [2024-11-13 06:21:26,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429307730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:21:26,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:21:26,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:21:26,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926643945] [2024-11-13 06:21:26,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:21:26,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:21:26,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:21:26,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:21:26,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:21:26,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:26,036 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:21:26,036 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-11-13 06:21:26,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:26,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:26,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:26,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:26,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 06:21:26,415 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-11-13 06:21:26,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:21:26,416 INFO L85 PathProgramCache]: Analyzing trace with hash -116164990, now seen corresponding path program 1 times [2024-11-13 06:21:26,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:21:26,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121686986] [2024-11-13 06:21:26,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:26,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:21:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:26,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:21:26,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:21:26,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121686986] [2024-11-13 06:21:26,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121686986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:21:26,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:21:26,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:21:26,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505920629] [2024-11-13 06:21:26,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:21:26,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:21:26,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:21:26,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:21:26,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:21:26,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:26,925 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:21:26,925 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-11-13 06:21:26,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:26,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:26,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:27,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:27,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:27,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:27,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 06:21:27,274 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-11-13 06:21:27,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:21:27,275 INFO L85 PathProgramCache]: Analyzing trace with hash -321667639, now seen corresponding path program 1 times [2024-11-13 06:21:27,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:21:27,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826025091] [2024-11-13 06:21:27,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:27,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:21:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:27,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:21:27,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:21:27,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826025091] [2024-11-13 06:21:27,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826025091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:21:27,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:21:27,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:21:27,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837572786] [2024-11-13 06:21:27,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:21:27,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:21:27,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:21:27,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:21:27,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:21:27,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:27,699 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:21:27,700 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-11-13 06:21:27,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:27,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:27,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:27,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:27,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:27,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:27,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:27,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:27,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 06:21:27,977 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-11-13 06:21:27,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:21:27,977 INFO L85 PathProgramCache]: Analyzing trace with hash 5503531, now seen corresponding path program 1 times [2024-11-13 06:21:27,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:21:27,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432811341] [2024-11-13 06:21:27,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:27,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:21:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:28,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:21:28,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:21:28,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432811341] [2024-11-13 06:21:28,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432811341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:21:28,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:21:28,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:21:28,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655443772] [2024-11-13 06:21:28,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:21:28,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:21:28,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:21:28,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:21:28,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:21:28,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:28,483 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:21:28,483 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-11-13 06:21:28,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:28,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:28,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:28,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:28,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:28,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:28,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:28,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:28,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:28,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:28,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 06:21:28,880 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-11-13 06:21:28,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:21:28,881 INFO L85 PathProgramCache]: Analyzing trace with hash 14722053, now seen corresponding path program 1 times [2024-11-13 06:21:28,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:21:28,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482935784] [2024-11-13 06:21:28,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:28,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:21:28,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:29,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:21:29,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:21:29,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482935784] [2024-11-13 06:21:29,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482935784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:21:29,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:21:29,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:21:29,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759331862] [2024-11-13 06:21:29,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:21:29,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:21:29,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:21:29,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:21:29,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:21:29,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:29,383 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:21:29,383 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-11-13 06:21:29,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:29,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:29,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:29,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:29,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:29,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:29,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:29,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:29,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:29,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:29,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:29,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:29,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 06:21:29,732 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-11-13 06:21:29,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:21:29,733 INFO L85 PathProgramCache]: Analyzing trace with hash 630566678, now seen corresponding path program 1 times [2024-11-13 06:21:29,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:21:29,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795551442] [2024-11-13 06:21:29,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:29,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:21:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:30,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:21:30,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:21:30,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795551442] [2024-11-13 06:21:30,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795551442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:21:30,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:21:30,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:21:30,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167399625] [2024-11-13 06:21:30,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:21:30,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:21:30,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:21:30,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:21:30,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:21:30,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:30,146 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:21:30,146 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-11-13 06:21:30,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:30,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:30,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:30,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:30,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:30,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:30,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:30,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:30,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:30,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:30,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:30,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:30,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:30,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:30,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 06:21:30,631 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-11-13 06:21:30,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:21:30,632 INFO L85 PathProgramCache]: Analyzing trace with hash 825583615, now seen corresponding path program 1 times [2024-11-13 06:21:30,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:21:30,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047501944] [2024-11-13 06:21:30,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:30,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:21:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:31,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:21:31,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:21:31,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047501944] [2024-11-13 06:21:31,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047501944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:21:31,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:21:31,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:21:31,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844987862] [2024-11-13 06:21:31,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:21:31,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:21:31,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:21:31,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:21:31,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:21:31,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:31,222 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:21:31,222 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-11-13 06:21:31,222 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:31,222 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:31,222 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:31,222 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:31,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:31,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:31,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:31,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:31,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:31,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:31,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:31,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:31,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:31,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:31,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:31,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:31,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 06:21:31,630 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-11-13 06:21:31,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:21:31,631 INFO L85 PathProgramCache]: Analyzing trace with hash 132716771, now seen corresponding path program 1 times [2024-11-13 06:21:31,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:21:31,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589196075] [2024-11-13 06:21:31,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:31,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:21:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:32,479 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:21:32,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:21:32,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589196075] [2024-11-13 06:21:32,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589196075] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:21:32,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615301889] [2024-11-13 06:21:32,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:32,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:21:32,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:21:32,484 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-11-13 06:21:32,485 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-11-13 06:21:32,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:32,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 06:21:32,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:21:32,904 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-11-13 06:21:32,928 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-11-13 06:21:32,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:21:32,955 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-11-13 06:21:32,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:21:32,997 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-11-13 06:21:33,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:21:33,180 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-11-13 06:21:33,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:21:33,208 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:21:35,443 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-11-13 06:21:39,659 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:21:39,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615301889] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:21:39,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:21:39,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-11-13 06:21:39,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100054833] [2024-11-13 06:21:39,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:21:39,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-13 06:21:39,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:21:39,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-13 06:21:39,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=275, Unknown=21, NotChecked=36, Total=420 [2024-11-13 06:21:39,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:39,664 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:21:39,665 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-11-13 06:21:39,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:39,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:39,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:39,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:39,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:39,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:39,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:39,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:39,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:39,782 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-11-13 06:21:39,786 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-11-13 06:21:40,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:40,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:40,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:40,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:40,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:40,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:40,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:40,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:40,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:21:40,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 06:21:41,133 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-11-13 06:21:41,133 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-11-13 06:21:41,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:21:41,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1894705520, now seen corresponding path program 1 times [2024-11-13 06:21:41,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:21:41,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975093546] [2024-11-13 06:21:41,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:41,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:21:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:41,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:21:41,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:21:41,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975093546] [2024-11-13 06:21:41,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975093546] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:21:41,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996927267] [2024-11-13 06:21:41,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:41,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:21:41,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:21:41,464 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-11-13 06:21:41,474 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-11-13 06:21:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:41,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 06:21:41,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:21:41,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:21:41,934 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:21:42,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:21:42,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996927267] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:21:42,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:21:42,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-13 06:21:42,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373445591] [2024-11-13 06:21:42,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:21:42,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 06:21:42,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:21:42,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 06:21:42,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-13 06:21:42,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:42,074 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:21:42,074 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-11-13 06:21:42,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:42,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:42,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:42,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:42,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:42,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:42,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:42,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:42,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:21:42,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:43,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:43,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:43,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:43,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:43,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:43,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:43,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:43,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:43,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:21:43,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:43,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-13 06:21:43,752 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-11-13 06:21:43,753 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-11-13 06:21:43,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:21:43,754 INFO L85 PathProgramCache]: Analyzing trace with hash -497922510, now seen corresponding path program 1 times [2024-11-13 06:21:43,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:21:43,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665269006] [2024-11-13 06:21:43,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:43,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:21:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:44,361 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:21:44,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:21:44,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665269006] [2024-11-13 06:21:44,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665269006] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:21:44,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176734459] [2024-11-13 06:21:44,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:44,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:21:44,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:21:44,366 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-11-13 06:21:44,369 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-11-13 06:21:44,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:44,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 06:21:44,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:21:44,782 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-11-13 06:21:44,805 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-11-13 06:21:44,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:21:44,834 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-11-13 06:21:44,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:21:44,874 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-11-13 06:21:44,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:21:44,973 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-11-13 06:21:44,979 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:21:44,980 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:21:44,994 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-11-13 06:21:45,089 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-11-13 06:21:45,102 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-11-13 06:21:47,173 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-13 06:21:47,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176734459] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:21:47,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:21:47,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-11-13 06:21:47,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275387211] [2024-11-13 06:21:47,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:21:47,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-13 06:21:47,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:21:47,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-13 06:21:47,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=235, Unknown=3, NotChecked=102, Total=420 [2024-11-13 06:21:47,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:47,176 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:21:47,177 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-11-13 06:21:47,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:47,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:47,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:47,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:47,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:47,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:47,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:47,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:47,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:21:47,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:47,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:48,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:48,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:48,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:48,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:48,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:48,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:48,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:48,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:48,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:21:48,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:48,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:21:48,896 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-11-13 06:21:49,083 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-11-13 06:21:49,083 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-11-13 06:21:49,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:21:49,084 INFO L85 PathProgramCache]: Analyzing trace with hash 761147142, now seen corresponding path program 1 times [2024-11-13 06:21:49,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:21:49,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136564088] [2024-11-13 06:21:49,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:49,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:21:49,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:49,687 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:21:49,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:21:49,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136564088] [2024-11-13 06:21:49,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136564088] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:21:49,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119670765] [2024-11-13 06:21:49,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:49,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:21:49,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:21:49,689 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-11-13 06:21:49,694 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-11-13 06:21:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:49,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-13 06:21:49,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:21:50,057 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-11-13 06:21:50,087 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-11-13 06:21:50,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:21:50,122 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-11-13 06:21:50,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:21:50,164 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-11-13 06:21:50,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:21:50,286 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-11-13 06:21:50,296 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:21:50,296 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:21:52,472 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-11-13 06:21:56,711 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:21:56,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119670765] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:21:56,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:21:56,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-11-13 06:21:56,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56134165] [2024-11-13 06:21:56,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:21:56,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-13 06:21:56,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:21:56,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-13 06:21:56,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=275, Unknown=19, NotChecked=36, Total=420 [2024-11-13 06:21:56,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:56,720 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:21:56,720 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-11-13 06:21:56,720 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:56,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:56,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:56,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:56,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:56,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:56,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:56,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:56,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:21:56,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:56,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:21:56,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:00,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:00,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:00,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:00,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:00,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:00,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:00,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:00,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:00,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:22:00,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:00,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:22:00,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:22:00,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-13 06:22:00,445 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-11-13 06:22:00,445 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-11-13 06:22:00,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:00,446 INFO L85 PathProgramCache]: Analyzing trace with hash 854399623, now seen corresponding path program 1 times [2024-11-13 06:22:00,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:00,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061786612] [2024-11-13 06:22:00,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:00,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:01,508 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:22:01,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:22:01,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061786612] [2024-11-13 06:22:01,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061786612] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:22:01,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787273515] [2024-11-13 06:22:01,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:01,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:22:01,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:22:01,510 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-11-13 06:22:01,512 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-11-13 06:22:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:01,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-13 06:22:01,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:22:01,851 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-13 06:22:01,851 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-11-13 06:22:01,951 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 06:22:01,952 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-11-13 06:22:02,155 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-11-13 06:22:02,188 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-11-13 06:22:02,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:22:02,231 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-11-13 06:22:02,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:22:02,276 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-11-13 06:22:02,389 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-11-13 06:22:02,414 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:22:02,414 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:22:02,434 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-11-13 06:22:02,529 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-11-13 06:22:06,785 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:22:06,785 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-11-13 06:22:06,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:22:06,792 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-11-13 06:22:06,802 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2024-11-13 06:22:06,802 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-11-13 06:22:06,807 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2024-11-13 06:22:06,807 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-11-13 06:22:06,812 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2024-11-13 06:22:06,812 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-11-13 06:22:10,992 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-13 06:22:10,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787273515] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:22:10,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:22:10,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 32 [2024-11-13 06:22:10,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962834366] [2024-11-13 06:22:10,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:22:10,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-13 06:22:10,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:10,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-13 06:22:10,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=786, Unknown=22, NotChecked=118, Total=1056 [2024-11-13 06:22:10,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:10,995 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:10,995 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-11-13 06:22:10,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:10,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:10,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:10,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:10,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:10,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:10,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:10,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:10,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:22:10,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:10,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:22:10,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:22:10,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:16,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:16,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:16,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:16,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:16,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:16,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:16,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:16,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:16,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:22:16,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:16,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:22:16,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:22:16,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 06:22:16,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 06:22:17,041 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-11-13 06:22:17,041 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-11-13 06:22:17,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:17,042 INFO L85 PathProgramCache]: Analyzing trace with hash 648737749, now seen corresponding path program 1 times [2024-11-13 06:22:17,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:17,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691343862] [2024-11-13 06:22:17,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:17,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:17,664 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:22:17,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:22:17,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691343862] [2024-11-13 06:22:17,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691343862] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:22:17,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915184276] [2024-11-13 06:22:17,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:17,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:22:17,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:22:17,667 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-11-13 06:22:17,669 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-11-13 06:22:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:17,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-13 06:22:17,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:22:17,993 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-11-13 06:22:18,011 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-11-13 06:22:18,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:22:18,036 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-11-13 06:22:18,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:22:18,065 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-11-13 06:22:18,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:22:18,161 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-11-13 06:22:18,167 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:22:18,167 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:22:18,182 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-11-13 06:22:18,264 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-11-13 06:22:18,276 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-11-13 06:22:20,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:22:20,344 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-11-13 06:22:20,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:22:20,348 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-11-13 06:22:20,354 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:22:20,354 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-11-13 06:22:20,358 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:22:20,358 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-11-13 06:22:20,362 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:22:20,362 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-11-13 06:22:20,467 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-13 06:22:20,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915184276] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:22:20,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:22:20,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2024-11-13 06:22:20,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995720044] [2024-11-13 06:22:20,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:22:20,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-13 06:22:20,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:20,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-13 06:22:20,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=490, Unknown=14, NotChecked=144, Total=756 [2024-11-13 06:22:20,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:20,470 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:20,470 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-11-13 06:22:20,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:20,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:20,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:20,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:20,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:20,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:20,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:20,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:20,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:22:20,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:20,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:22:20,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:22:20,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-11-13 06:22:20,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:22,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:22,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:22,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:22,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:22,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:22,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:22,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:22,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:22,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:22:22,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:22,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:22:22,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:22:22,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 06:22:22,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:22:22,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 06:22:22,750 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-11-13 06:22:22,755 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-11-13 06:22:22,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:22,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1710785580, now seen corresponding path program 1 times [2024-11-13 06:22:22,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:22,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399869500] [2024-11-13 06:22:22,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:22,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:22,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:23,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-11-13 06:22:23,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:22:23,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399869500] [2024-11-13 06:22:23,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399869500] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:22:23,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791779249] [2024-11-13 06:22:23,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:23,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:22:23,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:22:23,427 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-11-13 06:22:23,428 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-11-13 06:22:23,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:23,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-13 06:22:23,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:22:23,722 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-13 06:22:23,722 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-11-13 06:22:23,806 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 06:22:23,806 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-11-13 06:22:23,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 06:22:24,020 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-11-13 06:22:24,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:22:24,051 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-11-13 06:22:24,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:22:24,085 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-11-13 06:22:24,193 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-11-13 06:22:24,225 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:22:24,226 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:22:24,382 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-11-13 06:22:26,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:22:26,542 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-11-13 06:22:26,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:22:26,546 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-11-13 06:22:26,552 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2024-11-13 06:22:26,553 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-11-13 06:22:26,556 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2024-11-13 06:22:26,557 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-11-13 06:22:26,560 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2024-11-13 06:22:26,561 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-11-13 06:22:32,828 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:22:32,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791779249] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:22:32,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:22:32,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 33 [2024-11-13 06:22:32,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550045110] [2024-11-13 06:22:32,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:22:32,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-13 06:22:32,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:32,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-13 06:22:32,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=907, Unknown=36, NotChecked=62, Total=1122 [2024-11-13 06:22:32,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:32,831 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:32,831 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-11-13 06:22:32,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:32,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:32,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:32,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:32,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:32,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:32,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:32,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:32,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:22:32,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:32,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:22:32,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:22:32,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-11-13 06:22:32,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:22:32,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:35,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:35,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:35,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:35,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:35,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:35,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:35,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:35,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:35,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:22:35,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:35,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:22:35,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:22:35,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 06:22:35,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:22:35,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 06:22:35,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 06:22:35,779 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-11-13 06:22:35,780 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-11-13 06:22:35,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:35,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1146053009, now seen corresponding path program 1 times [2024-11-13 06:22:35,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:35,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287141133] [2024-11-13 06:22:35,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:35,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:35,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:36,272 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:22:36,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:22:36,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287141133] [2024-11-13 06:22:36,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287141133] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:22:36,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906520939] [2024-11-13 06:22:36,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:36,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:22:36,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:22:36,275 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-11-13 06:22:36,277 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-11-13 06:22:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:36,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-13 06:22:36,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:22:36,586 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-11-13 06:22:36,612 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-11-13 06:22:36,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:22:36,640 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-11-13 06:22:36,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:22:36,678 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-11-13 06:22:36,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:22:36,791 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-11-13 06:22:36,799 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:22:36,800 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:22:36,828 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-11-13 06:22:36,930 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-11-13 06:22:41,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-13 06:22:41,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906520939] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:22:41,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:22:41,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2024-11-13 06:22:41,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898449536] [2024-11-13 06:22:41,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:22:41,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-13 06:22:41,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:41,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-13 06:22:41,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=539, Unknown=13, NotChecked=98, Total=756 [2024-11-13 06:22:41,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:41,096 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:41,097 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-11-13 06:22:41,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:41,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:41,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:41,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:41,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:41,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:41,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:41,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:41,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:22:41,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:41,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:22:41,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:22:41,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-11-13 06:22:41,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:22:41,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-13 06:22:41,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:43,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:43,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:43,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:43,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:43,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:43,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:43,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:43,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:43,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:22:43,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:43,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:22:43,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:22:43,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 06:22:43,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:22:43,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 06:22:43,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:22:43,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-13 06:22:43,517 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-11-13 06:22:43,517 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-11-13 06:22:43,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:43,518 INFO L85 PathProgramCache]: Analyzing trace with hash -801948412, now seen corresponding path program 1 times [2024-11-13 06:22:43,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:43,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883483408] [2024-11-13 06:22:43,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:43,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:43,979 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:22:43,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:22:43,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883483408] [2024-11-13 06:22:43,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883483408] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:22:43,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327719106] [2024-11-13 06:22:43,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:43,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:22:43,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:22:43,983 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-11-13 06:22:43,992 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-11-13 06:22:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:44,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 06:22:44,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:22:44,320 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-11-13 06:22:44,339 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-11-13 06:22:44,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:22:44,363 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-11-13 06:22:44,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:22:44,394 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-11-13 06:22:44,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:22:44,491 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-11-13 06:22:44,498 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:22:44,498 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:22:44,512 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-11-13 06:22:44,569 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-11-13 06:22:48,733 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-13 06:22:48,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327719106] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:22:48,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:22:48,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2024-11-13 06:22:48,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858912007] [2024-11-13 06:22:48,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:22:48,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-13 06:22:48,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:48,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-13 06:22:48,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=539, Unknown=11, NotChecked=98, Total=756 [2024-11-13 06:22:48,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:48,739 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:48,739 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-11-13 06:22:48,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:48,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:48,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:48,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:48,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:48,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:48,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:48,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:48,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:22:48,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:48,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:22:48,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:22:48,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-11-13 06:22:48,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:22:48,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-13 06:22:48,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:22:48,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:50,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:50,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:50,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:50,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:50,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:50,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:50,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:50,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:50,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:22:50,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:50,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:22:50,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:22:50,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 06:22:50,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:22:50,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 06:22:50,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:22:50,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:22:50,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (9 of 10 remaining) [2024-11-13 06:22:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2024-11-13 06:22:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2024-11-13 06:22:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2024-11-13 06:22:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2024-11-13 06:22:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr9ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2024-11-13 06:22:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2024-11-13 06:22:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr7ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2024-11-13 06:22:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr6ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2024-11-13 06:22:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr8ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2024-11-13 06:22:50,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 06:22:50,478 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-11-13 06:22:50,505 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 06:22:50,506 INFO L317 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2024-11-13 06:22:50,517 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:22:50,525 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 06:22:50,525 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 06:22:50,526 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;@4593bddb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:22:50,526 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-13 06:22:50,528 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-11-13 06:22:50,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:50,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1498853862, now seen corresponding path program 1 times [2024-11-13 06:22:50,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:50,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969302998] [2024-11-13 06:22:50,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:50,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:50,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:22:50,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:22:50,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969302998] [2024-11-13 06:22:50,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969302998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:22:50,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:22:50,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:22:50,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578805482] [2024-11-13 06:22:50,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:22:50,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:22:50,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:50,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:22:50,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:22:50,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:50,681 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:50,682 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-11-13 06:22:50,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:50,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:50,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 06:22:50,744 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-11-13 06:22:50,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:50,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1333600576, now seen corresponding path program 1 times [2024-11-13 06:22:50,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:50,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764262794] [2024-11-13 06:22:50,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:50,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:50,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:22:50,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:22:50,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764262794] [2024-11-13 06:22:50,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764262794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:22:50,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:22:50,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:22:50,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099822299] [2024-11-13 06:22:50,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:22:50,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:22:50,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:50,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:22:50,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:22:50,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:50,870 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:50,870 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-11-13 06:22:50,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:50,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:50,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:50,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:50,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 06:22:50,904 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-11-13 06:22:50,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:50,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1170861615, now seen corresponding path program 1 times [2024-11-13 06:22:50,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:50,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098625106] [2024-11-13 06:22:50,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:50,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:51,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:22:51,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:22:51,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098625106] [2024-11-13 06:22:51,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098625106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:22:51,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:22:51,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:22:51,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003427138] [2024-11-13 06:22:51,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:22:51,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:22:51,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:51,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:22:51,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:22:51,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:51,039 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:51,039 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-11-13 06:22:51,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:51,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:51,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:51,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:51,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:51,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:51,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 06:22:51,090 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-11-13 06:22:51,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:51,091 INFO L85 PathProgramCache]: Analyzing trace with hash 91996484, now seen corresponding path program 1 times [2024-11-13 06:22:51,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:51,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126660838] [2024-11-13 06:22:51,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:51,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:51,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:22:51,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:22:51,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126660838] [2024-11-13 06:22:51,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126660838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:22:51,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:22:51,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:22:51,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172641778] [2024-11-13 06:22:51,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:22:51,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:22:51,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:51,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:22:51,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:22:51,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:51,239 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:51,239 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-11-13 06:22:51,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:51,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:51,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:51,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:51,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:51,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:51,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:51,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:51,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 06:22:51,307 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-11-13 06:22:51,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:51,308 INFO L85 PathProgramCache]: Analyzing trace with hash -523586412, now seen corresponding path program 1 times [2024-11-13 06:22:51,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:51,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509075950] [2024-11-13 06:22:51,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:51,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:51,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:22:51,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:22:51,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509075950] [2024-11-13 06:22:51,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509075950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:22:51,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:22:51,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:22:51,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517408552] [2024-11-13 06:22:51,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:22:51,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:22:51,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:51,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:22:51,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:22:51,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:51,484 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:51,484 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-11-13 06:22:51,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:51,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:51,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:51,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:51,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:51,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:51,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:51,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:51,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:51,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:51,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-13 06:22:51,723 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-11-13 06:22:51,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:51,724 INFO L85 PathProgramCache]: Analyzing trace with hash 527808276, now seen corresponding path program 1 times [2024-11-13 06:22:51,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:51,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187369270] [2024-11-13 06:22:51,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:51,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 06:22:51,745 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 06:22:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 06:22:51,796 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 06:22:51,796 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 06:22:51,796 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 20 remaining) [2024-11-13 06:22:51,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining) [2024-11-13 06:22:51,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining) [2024-11-13 06:22:51,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining) [2024-11-13 06:22:51,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (15 of 20 remaining) [2024-11-13 06:22:51,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (14 of 20 remaining) [2024-11-13 06:22:51,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (13 of 20 remaining) [2024-11-13 06:22:51,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining) [2024-11-13 06:22:51,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining) [2024-11-13 06:22:51,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining) [2024-11-13 06:22:51,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (9 of 20 remaining) [2024-11-13 06:22:51,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (8 of 20 remaining) [2024-11-13 06:22:51,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining) [2024-11-13 06:22:51,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining) [2024-11-13 06:22:51,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining) [2024-11-13 06:22:51,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining) [2024-11-13 06:22:51,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining) [2024-11-13 06:22:51,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining) [2024-11-13 06:22:51,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining) [2024-11-13 06:22:51,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining) [2024-11-13 06:22:51,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-13 06:22:51,802 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-13 06:22:51,802 INFO L317 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-11-13 06:22:51,803 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 06:22:51,803 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-13 06:22:51,845 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-13 06:22:51,850 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:22:51,851 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 06:22:51,851 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of2ForFork0 ======== [2024-11-13 06:22:51,851 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;@4593bddb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:22:51,852 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-11-13 06:22:52,049 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-11-13 06:22:52,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:52,049 INFO L85 PathProgramCache]: Analyzing trace with hash -316339307, now seen corresponding path program 1 times [2024-11-13 06:22:52,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:52,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407968039] [2024-11-13 06:22:52,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:52,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:52,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:22:52,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:22:52,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407968039] [2024-11-13 06:22:52,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407968039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:22:52,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:22:52,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:22:52,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635239340] [2024-11-13 06:22:52,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:22:52,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:22:52,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:52,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:22:52,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:22:52,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:52,258 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:52,258 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-11-13 06:22:52,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:52,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:52,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-13 06:22:52,560 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-11-13 06:22:52,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:52,560 INFO L85 PathProgramCache]: Analyzing trace with hash -792837606, now seen corresponding path program 1 times [2024-11-13 06:22:52,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:52,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793931983] [2024-11-13 06:22:52,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:52,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:52,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:22:52,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:22:52,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793931983] [2024-11-13 06:22:52,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793931983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:22:52,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:22:52,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:22:52,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737035909] [2024-11-13 06:22:52,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:22:52,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:22:52,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:52,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:22:52,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:22:52,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:52,790 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:52,790 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-11-13 06:22:52,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:52,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:53,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:53,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:53,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-13 06:22:53,090 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-11-13 06:22:53,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:53,090 INFO L85 PathProgramCache]: Analyzing trace with hash 67355966, now seen corresponding path program 1 times [2024-11-13 06:22:53,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:53,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465227496] [2024-11-13 06:22:53,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:53,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:53,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:22:53,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:22:53,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465227496] [2024-11-13 06:22:53,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465227496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:22:53,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:22:53,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:22:53,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026570402] [2024-11-13 06:22:53,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:22:53,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:22:53,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:53,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:22:53,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:22:53,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:53,380 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:53,380 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-11-13 06:22:53,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:53,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:53,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:53,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:53,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:53,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:53,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-13 06:22:53,653 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-11-13 06:22:53,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:53,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1111322330, now seen corresponding path program 1 times [2024-11-13 06:22:53,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:53,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196479444] [2024-11-13 06:22:53,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:53,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:53,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:22:53,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:22:53,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196479444] [2024-11-13 06:22:53,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196479444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:22:53,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:22:53,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:22:53,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019583258] [2024-11-13 06:22:53,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:22:53,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:22:53,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:53,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:22:53,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:22:53,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:53,914 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:53,914 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-11-13 06:22:53,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:53,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:53,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:53,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:54,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:54,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:54,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:54,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:54,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-13 06:22:54,232 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-11-13 06:22:54,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:54,233 INFO L85 PathProgramCache]: Analyzing trace with hash -383620633, now seen corresponding path program 1 times [2024-11-13 06:22:54,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:54,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612333078] [2024-11-13 06:22:54,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:54,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:54,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:22:54,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:22:54,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612333078] [2024-11-13 06:22:54,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612333078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:22:54,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:22:54,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:22:54,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471848335] [2024-11-13 06:22:54,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:22:54,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:22:54,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:54,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:22:54,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:22:54,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:54,557 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:54,557 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-11-13 06:22:54,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:54,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:54,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:54,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:54,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:54,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:54,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:54,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:54,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:54,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:54,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-13 06:22:54,936 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-11-13 06:22:54,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:54,936 INFO L85 PathProgramCache]: Analyzing trace with hash -150803199, now seen corresponding path program 1 times [2024-11-13 06:22:54,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:54,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023982359] [2024-11-13 06:22:54,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:54,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:55,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:22:55,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:22:55,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023982359] [2024-11-13 06:22:55,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023982359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:22:55,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:22:55,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:22:55,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950182003] [2024-11-13 06:22:55,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:22:55,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:22:55,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:55,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:22:55,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:22:55,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:55,279 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:55,279 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-11-13 06:22:55,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:55,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:55,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:55,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:55,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:55,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:55,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:55,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:55,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:55,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:55,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:55,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:55,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-13 06:22:55,840 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-11-13 06:22:55,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:55,841 INFO L85 PathProgramCache]: Analyzing trace with hash -2110453614, now seen corresponding path program 1 times [2024-11-13 06:22:55,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:55,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990983141] [2024-11-13 06:22:55,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:55,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:56,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:22:56,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:22:56,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990983141] [2024-11-13 06:22:56,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990983141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:22:56,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:22:56,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:22:56,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108291693] [2024-11-13 06:22:56,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:22:56,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:22:56,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:56,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:22:56,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:22:56,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:56,364 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:56,364 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-11-13 06:22:56,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:56,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:56,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:56,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:56,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:56,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:56,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:56,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:56,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:56,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:56,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:56,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:56,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:56,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:56,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-13 06:22:56,947 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-11-13 06:22:56,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:56,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1452713253, now seen corresponding path program 1 times [2024-11-13 06:22:56,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:56,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017640022] [2024-11-13 06:22:56,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:56,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:57,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:22:57,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:22:57,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017640022] [2024-11-13 06:22:57,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017640022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:22:57,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:22:57,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:22:57,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130236567] [2024-11-13 06:22:57,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:22:57,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:22:57,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:57,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:22:57,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:22:57,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:57,327 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:57,327 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-11-13 06:22:57,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:57,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:57,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:57,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:57,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:57,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:57,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:57,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:23:05,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:05,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:05,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:05,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:05,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:05,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:05,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:05,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:05,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-13 06:23:05,836 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-11-13 06:23:05,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:23:05,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1137416192, now seen corresponding path program 1 times [2024-11-13 06:23:05,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:23:05,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742948848] [2024-11-13 06:23:05,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:23:05,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:23:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:23:06,397 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:23:06,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:23:06,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742948848] [2024-11-13 06:23:06,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742948848] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:23:06,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580301674] [2024-11-13 06:23:06,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:23:06,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:23:06,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:23:06,404 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:23:06,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 06:23:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:23:06,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 06:23:06,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:23:06,866 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-11-13 06:23:06,881 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-11-13 06:23:06,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:06,903 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-11-13 06:23:06,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:06,932 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-11-13 06:23:07,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:23:07,023 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-11-13 06:23:07,031 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:23:07,031 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:23:07,048 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-11-13 06:23:07,108 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-11-13 06:23:07,120 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-11-13 06:23:09,258 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-13 06:23:09,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580301674] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:23:09,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:23:09,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-11-13 06:23:09,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257300183] [2024-11-13 06:23:09,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:23:09,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-13 06:23:09,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:23:09,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-13 06:23:09,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=235, Unknown=3, NotChecked=102, Total=420 [2024-11-13 06:23:09,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:23:09,262 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:23:09,263 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-11-13 06:23:09,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:09,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:09,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:09,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:09,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:09,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:09,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:09,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:09,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:23:09,349 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-11-13 06:23:09,352 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-11-13 06:23:16,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:16,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:16,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:16,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:16,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:16,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:16,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:16,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:16,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:23:16,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-13 06:23:16,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:23:16,668 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-11-13 06:23:16,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:23:16,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1513541754, now seen corresponding path program 1 times [2024-11-13 06:23:16,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:23:16,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201051224] [2024-11-13 06:23:16,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:23:16,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:23:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:23:17,117 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-13 06:23:17,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:23:17,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201051224] [2024-11-13 06:23:17,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201051224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:23:17,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:23:17,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 06:23:17,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28064841] [2024-11-13 06:23:17,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:23:17,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:23:17,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:23:17,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:23:17,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:23:17,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:23:17,121 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:23:17,121 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-11-13 06:23:17,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:17,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:17,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:17,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:17,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:17,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:17,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:17,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:17,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:23:17,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:23:24,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:24,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:24,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:24,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:24,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:24,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:24,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:24,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:24,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:23:24,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:24,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-13 06:23:24,818 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-11-13 06:23:24,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:23:24,820 INFO L85 PathProgramCache]: Analyzing trace with hash 251180490, now seen corresponding path program 1 times [2024-11-13 06:23:24,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:23:24,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500559762] [2024-11-13 06:23:24,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:23:24,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:23:24,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:23:26,020 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 06:23:26,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:23:26,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500559762] [2024-11-13 06:23:26,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500559762] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:23:26,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959422114] [2024-11-13 06:23:26,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:23:26,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:23:26,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:23:26,024 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:23:26,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 06:23:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:23:26,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-13 06:23:26,436 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:23:26,456 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-11-13 06:23:26,728 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-11-13 06:23:26,755 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-11-13 06:23:26,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:26,806 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-11-13 06:23:26,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:26,854 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-11-13 06:23:26,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:23:26,976 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-11-13 06:23:26,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:23:26,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-11-13 06:23:27,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:23:27,008 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-11-13 06:23:27,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:23:27,024 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-11-13 06:23:27,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:23:27,143 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-11-13 06:23:27,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:23:27,160 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-11-13 06:23:27,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:23:27,176 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-11-13 06:23:27,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:23:27,191 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-11-13 06:23:27,278 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 06:23:27,279 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-11-13 06:23:27,353 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-11-13 06:23:27,361 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 06:23:27,361 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:23:27,444 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-11-13 06:23:27,460 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-11-13 06:23:27,475 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_#t~malloc36#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_#t~malloc36#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_#t~malloc36#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_#t~malloc36#1.base| v_ArrVal_6224) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) is different from false [2024-11-13 06:23:32,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:32,504 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-11-13 06:23:32,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:32,510 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-11-13 06:23:32,515 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-11-13 06:23:32,518 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-11-13 06:23:32,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:32,539 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-11-13 06:23:32,542 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:23:32,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:32,545 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-11-13 06:23:32,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:32,557 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-11-13 06:23:32,559 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:23:32,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:32,563 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-11-13 06:23:32,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:32,575 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-11-13 06:23:32,578 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:23:32,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:32,582 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-11-13 06:23:39,047 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-11-13 06:23:39,086 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 06:23:39,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959422114] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:23:39,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:23:39,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 34 [2024-11-13 06:23:39,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037587352] [2024-11-13 06:23:39,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:23:39,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-13 06:23:39,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:23:39,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-13 06:23:39,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=818, Unknown=33, NotChecked=186, Total=1190 [2024-11-13 06:23:39,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:23:39,090 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:23:39,090 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-11-13 06:23:39,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:39,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:39,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:39,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:39,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:39,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:39,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:39,091 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:39,091 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:23:39,091 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:39,091 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:23:48,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:48,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:48,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:48,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:48,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:48,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:48,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:48,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:48,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:23:48,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:48,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:23:48,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-13 06:23:48,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-11-13 06:23:48,922 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-11-13 06:23:48,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:23:48,923 INFO L85 PathProgramCache]: Analyzing trace with hash -242594152, now seen corresponding path program 1 times [2024-11-13 06:23:48,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:23:48,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334637309] [2024-11-13 06:23:48,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:23:48,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:23:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:23:50,871 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 06:23:50,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:23:50,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334637309] [2024-11-13 06:23:50,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334637309] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:23:50,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336895669] [2024-11-13 06:23:50,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:23:50,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:23:50,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:23:50,873 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-11-13 06:23:50,874 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-11-13 06:23:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:23:51,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-11-13 06:23:51,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:23:51,364 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-13 06:23:51,365 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-11-13 06:23:51,458 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 06:23:51,458 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-11-13 06:23:51,554 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 06:23:51,555 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-11-13 06:23:52,745 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-11-13 06:23:52,795 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-11-13 06:23:52,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:52,850 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-11-13 06:23:52,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:52,922 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-11-13 06:23:53,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:23:53,148 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-11-13 06:23:53,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:23:53,174 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-11-13 06:23:53,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:23:53,195 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-11-13 06:23:53,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:23:53,211 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-11-13 06:23:53,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:23:53,448 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-11-13 06:23:53,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:23:53,475 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-11-13 06:23:53,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:23:53,499 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-11-13 06:23:53,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:23:53,520 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-11-13 06:23:53,644 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2024-11-13 06:23:53,644 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-11-13 06:23:53,946 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-11-13 06:23:53,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-11-13 06:23:53,978 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-11-13 06:23:53,998 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-11-13 06:23:54,088 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-11-13 06:23:54,103 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-11-13 06:23:54,133 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-11-13 06:23:54,150 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-11-13 06:23:54,371 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-11-13 06:23:54,412 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 06:23:54,412 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:23:54,512 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-11-13 06:23:54,533 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-11-13 06:23:54,796 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-11-13 06:23:56,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:56,322 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-11-13 06:23:56,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:56,328 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-11-13 06:23:56,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 62 treesize of output 54 [2024-11-13 06:23:56,339 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-11-13 06:23:56,343 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-11-13 06:23:56,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:56,386 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-11-13 06:23:56,388 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:23:56,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:56,392 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-11-13 06:23:56,398 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-11-13 06:23:56,405 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-11-13 06:23:56,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:56,431 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-11-13 06:23:56,434 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:23:56,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:56,437 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-11-13 06:23:56,445 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-11-13 06:23:56,447 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-11-13 06:23:56,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:56,469 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-11-13 06:23:56,473 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:23:56,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:56,477 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-11-13 06:23:56,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 28 treesize of output 24 [2024-11-13 06:23:56,487 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-11-13 06:24:01,498 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 06:24:01,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336895669] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:24:01,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:24:01,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 19] total 58 [2024-11-13 06:24:01,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341268014] [2024-11-13 06:24:01,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:24:01,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-11-13 06:24:01,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:24:01,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-11-13 06:24:01,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=2681, Unknown=131, NotChecked=330, Total=3422 [2024-11-13 06:24:01,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:24:01,510 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:24:01,511 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-11-13 06:24:01,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:01,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:01,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:01,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:01,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:01,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:01,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:01,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:01,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:24:01,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:01,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:24:01,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:24:09,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:09,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:09,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:09,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:09,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:09,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:09,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:09,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:09,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:24:09,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:09,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:24:09,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-13 06:24:09,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-13 06:24:09,504 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,SelfDestructingSolverStorable34 [2024-11-13 06:24:09,505 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-11-13 06:24:09,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:24:09,505 INFO L85 PathProgramCache]: Analyzing trace with hash 682830137, now seen corresponding path program 1 times [2024-11-13 06:24:09,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:24:09,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339227160] [2024-11-13 06:24:09,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:24:09,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:24:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:24:11,702 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 06:24:11,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:24:11,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339227160] [2024-11-13 06:24:11,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339227160] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:24:11,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827055352] [2024-11-13 06:24:11,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:24:11,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:24:11,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:24:11,704 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-11-13 06:24:11,705 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-11-13 06:24:12,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:24:12,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 93 conjuncts are in the unsatisfiable core [2024-11-13 06:24:12,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:24:12,267 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-13 06:24:12,267 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-11-13 06:24:12,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 06:24:12,351 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-11-13 06:24:12,480 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 06:24:12,480 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-11-13 06:24:12,591 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 06:24:12,591 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-11-13 06:24:13,562 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-11-13 06:24:13,623 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-11-13 06:24:13,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:13,676 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-11-13 06:24:13,735 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:13,735 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-11-13 06:24:13,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:13,955 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-11-13 06:24:13,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:13,983 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-11-13 06:24:14,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:14,004 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-11-13 06:24:14,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:14,029 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-11-13 06:24:14,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:14,247 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-11-13 06:24:14,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:14,269 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-11-13 06:24:14,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:14,294 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-11-13 06:24:14,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:14,318 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-11-13 06:24:14,443 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2024-11-13 06:24:14,444 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-11-13 06:24:14,793 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-11-13 06:24:14,812 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-11-13 06:24:14,837 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-11-13 06:24:14,859 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-11-13 06:24:14,953 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-11-13 06:24:14,974 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-11-13 06:24:14,996 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-11-13 06:24:15,016 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-11-13 06:24:15,344 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-11-13 06:24:15,368 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-11-13 06:24:15,381 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-11-13 06:24:15,406 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-11-13 06:24:15,512 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-11-13 06:24:15,558 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 06:24:15,558 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:24:15,572 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-11-13 06:24:15,731 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_~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)) (v_ArrVal_7317 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_7317) |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|)) |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_t_funThread2of2ForFork0_insert_#in~list#1.base| v_ArrVal_7317) |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|)))) (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_~p#1.base| v_ArrVal_7318) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) is different from false [2024-11-13 06:24:15,742 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-11-13 06:24:15,760 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-11-13 06:24:15,909 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7313 (Array Int Int)) (v_ArrVal_7318 (Array Int Int)) (v_ArrVal_7317 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_7313) |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|)))) (forall ((v_ArrVal_7313 (Array Int Int)) (v_ArrVal_7318 (Array Int Int)) (v_ArrVal_7317 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_7313) |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_7313 (Array Int Int)) (v_ArrVal_7318 (Array Int Int)) (v_ArrVal_7317 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_7313) |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_7313 (Array Int Int)) (v_ArrVal_7318 (Array Int Int)) (v_ArrVal_7317 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store (store |c_#race| |c_t_funThread2of2ForFork0_init_~p#1.base| v_ArrVal_7313) |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|)))) is different from false [2024-11-13 06:24:16,191 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-11-13 06:24:17,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:17,284 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-11-13 06:24:17,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:17,289 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-11-13 06:24:17,295 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-11-13 06:24:17,298 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-11-13 06:24:17,301 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-11-13 06:24:17,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:17,360 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-11-13 06:24:17,363 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:24:17,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:17,367 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-11-13 06:24:17,371 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-11-13 06:24:17,374 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-11-13 06:24:17,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:17,391 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-11-13 06:24:17,394 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:24:17,397 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:17,398 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-11-13 06:24:17,402 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-11-13 06:24:17,404 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-11-13 06:24:17,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:17,423 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-11-13 06:24:17,426 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:24:17,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:17,429 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-11-13 06:24:17,434 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-11-13 06:24:17,437 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-11-13 06:24:22,466 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 06:24:22,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827055352] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:24:22,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:24:22,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 28, 20] total 64 [2024-11-13 06:24:22,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266694538] [2024-11-13 06:24:22,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:24:22,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-11-13 06:24:22,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:24:22,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-11-13 06:24:22,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=3076, Unknown=87, NotChecked=714, Total=4160 [2024-11-13 06:24:22,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:24:22,484 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:24:22,484 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-11-13 06:24:22,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:22,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:22,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:22,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:22,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:22,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:22,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:22,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:22,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:24:22,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:22,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:24:22,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-11-13 06:24:22,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:24:38,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:38,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:38,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:38,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:38,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:38,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:38,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:38,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:38,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:24:38,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:38,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:24:38,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-13 06:24:38,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-13 06:24:38,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-13 06:24:38,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-13 06:24:38,497 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-11-13 06:24:38,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:24:38,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1092361879, now seen corresponding path program 1 times [2024-11-13 06:24:38,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:24:38,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074826024] [2024-11-13 06:24:38,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:24:38,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:24:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:24:38,641 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:24:38,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:24:38,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074826024] [2024-11-13 06:24:38,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074826024] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:24:38,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834050630] [2024-11-13 06:24:38,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:24:38,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:24:38,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:24:38,644 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-11-13 06:24:38,645 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-11-13 06:24:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:24:39,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 845 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 06:24:39,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:24:39,204 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:24:39,204 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:24:39,482 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:24:39,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834050630] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:24:39,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:24:39,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-11-13 06:24:39,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530587521] [2024-11-13 06:24:39,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:24:39,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 06:24:39,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:24:39,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 06:24:39,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-13 06:24:39,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:24:39,485 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:24:39,486 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-11-13 06:24:39,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:39,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:39,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:39,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:39,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:39,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:39,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:39,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:39,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:24:39,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:39,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:24:39,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-11-13 06:24:39,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-13 06:24:39,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:24:41,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:41,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:41,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:41,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:41,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:41,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:41,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:41,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:41,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:24:41,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:41,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:24:41,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-13 06:24:41,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-13 06:24:41,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:24:41,666 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-11-13 06:24:41,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:24:41,852 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-11-13 06:24:41,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:24:41,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1532964668, now seen corresponding path program 2 times [2024-11-13 06:24:41,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:24:41,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668327266] [2024-11-13 06:24:41,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:24:41,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:24:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:24:42,909 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 06:24:42,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:24:42,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668327266] [2024-11-13 06:24:42,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668327266] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:24:42,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573650683] [2024-11-13 06:24:42,910 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 06:24:42,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:24:42,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:24:42,912 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-11-13 06:24:42,914 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-11-13 06:24:44,030 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 06:24:44,030 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 06:24:44,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-13 06:24:44,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:24:44,064 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-11-13 06:24:44,472 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-11-13 06:24:44,507 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-11-13 06:24:44,603 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-11-13 06:24:44,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:44,716 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-11-13 06:24:44,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:44,731 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-11-13 06:24:44,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:44,745 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-11-13 06:24:44,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:44,759 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-11-13 06:24:44,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:44,869 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-11-13 06:24:44,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:44,884 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-11-13 06:24:44,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:44,901 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-11-13 06:24:44,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:44,913 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-11-13 06:24:44,971 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 06:24:44,971 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-11-13 06:24:45,124 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-11-13 06:24:45,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:45,157 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-11-13 06:24:45,188 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 06:24:45,188 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:24:45,205 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-11-13 06:24:45,225 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_#in~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_#in~p#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_init_#in~p#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-11-13 06:24:45,290 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-11-13 06:24:47,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:47,920 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-11-13 06:24:47,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:47,925 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-11-13 06:24:47,929 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-11-13 06:24:47,932 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-11-13 06:24:47,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:47,947 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-11-13 06:24:47,949 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:24:47,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:47,952 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-11-13 06:24:47,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:47,961 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-11-13 06:24:47,963 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:24:47,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:47,966 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-11-13 06:24:52,411 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-11-13 06:24:52,449 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 06:24:52,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573650683] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:24:52,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:24:52,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 38 [2024-11-13 06:24:52,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228359375] [2024-11-13 06:24:52,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:24:52,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-13 06:24:52,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:24:52,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-13 06:24:52,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1091, Unknown=23, NotChecked=210, Total=1482 [2024-11-13 06:24:52,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:24:52,453 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:24:52,453 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-11-13 06:24:52,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:52,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:52,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:52,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:52,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:52,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:52,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:52,454 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:52,454 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:24:52,454 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:52,454 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:24:52,454 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-11-13 06:24:52,454 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-13 06:24:52,454 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:24:52,454 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:24:56,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:56,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:56,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:56,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:56,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:56,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:56,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:56,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:56,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:24:56,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:56,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:24:56,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-13 06:24:56,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-13 06:24:56,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:24:56,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 06:24:56,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-13 06:24:56,414 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,SelfDestructingSolverStorable37 [2024-11-13 06:24:56,414 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-11-13 06:24:56,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:24:56,414 INFO L85 PathProgramCache]: Analyzing trace with hash 127751398, now seen corresponding path program 2 times [2024-11-13 06:24:56,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:24:56,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900461890] [2024-11-13 06:24:56,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:24:56,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:24:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:24:58,366 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 06:24:58,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:24:58,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900461890] [2024-11-13 06:24:58,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900461890] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:24:58,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536393565] [2024-11-13 06:24:58,367 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 06:24:58,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:24:58,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:24:58,368 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-11-13 06:24:58,369 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-11-13 06:24:59,877 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 06:24:59,877 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 06:24:59,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-13 06:24:59,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:24:59,990 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-13 06:24:59,991 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-11-13 06:25:00,196 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 06:25:00,196 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-11-13 06:25:00,333 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-11-13 06:25:00,333 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-11-13 06:25:01,854 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-11-13 06:25:01,916 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-11-13 06:25:01,976 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-11-13 06:25:02,211 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-11-13 06:25:02,235 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-11-13 06:25:02,256 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-11-13 06:25:02,282 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-11-13 06:25:02,640 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-11-13 06:25:02,668 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-11-13 06:25:02,697 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-11-13 06:25:02,712 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-11-13 06:25:02,889 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-13 06:25:02,890 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-11-13 06:25:03,156 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-11-13 06:25:03,185 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-11-13 06:25:03,283 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-11-13 06:25:03,305 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-11-13 06:25:03,331 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-11-13 06:25:03,446 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-11-13 06:25:03,477 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-11-13 06:25:03,491 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-11-13 06:25:03,516 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-11-13 06:25:03,839 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-11-13 06:25:03,879 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 06:25:03,879 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:25:04,537 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-11-13 06:25:05,097 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-11-13 06:25:05,205 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-11-13 06:25:05,259 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-11-13 06:25:05,311 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-11-13 06:25:08,681 INFO L349 Elim1Store]: treesize reduction 23, result has 62.9 percent of original size [2024-11-13 06:25:08,682 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-11-13 06:25:08,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:25:08,717 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-11-13 06:25:08,745 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-11-13 06:25:08,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 572 treesize of output 564 [2024-11-13 06:25:08,778 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-11-13 06:25:09,287 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:25:09,299 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:25:09,322 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:25:09,346 INFO L349 Elim1Store]: treesize reduction 23, result has 62.9 percent of original size [2024-11-13 06:25:09,347 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-11-13 06:25:09,355 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:25:09,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:25:09,363 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-11-13 06:25:09,373 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-11-13 06:25:09,381 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-11-13 06:25:09,497 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:25:09,522 INFO L349 Elim1Store]: treesize reduction 23, result has 62.9 percent of original size [2024-11-13 06:25:09,523 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-11-13 06:25:09,531 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:25:09,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:25:09,539 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-11-13 06:25:09,546 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-11-13 06:25:09,554 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-11-13 06:25:09,758 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:25:09,777 INFO L349 Elim1Store]: treesize reduction 38, result has 38.7 percent of original size [2024-11-13 06:25:09,777 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-11-13 06:25:09,784 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:25:09,792 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 06:25:09,792 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-11-13 06:25:09,810 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-11-13 06:25:16,063 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 06:25:16,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536393565] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:25:16,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:25:16,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 20] total 60 [2024-11-13 06:25:16,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635630306] [2024-11-13 06:25:16,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:25:16,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2024-11-13 06:25:16,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:25:16,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2024-11-13 06:25:16,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=2743, Unknown=58, NotChecked=560, Total=3660 [2024-11-13 06:25:16,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:25:16,067 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:25:16,067 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-11-13 06:25:16,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:25:16,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:25:16,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:25:16,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:25:16,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:25:16,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:25:16,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:25:16,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:25:16,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:25:16,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:25:16,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:25:16,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-11-13 06:25:16,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-13 06:25:16,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:25:16,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-13 06:25:16,069 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:25:30,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:25:30,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:25:30,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:25:30,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:25:30,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:25:30,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:25:30,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:25:30,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:25:30,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:25:30,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:25:30,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:25:30,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-13 06:25:30,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-13 06:25:30,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:25:30,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 06:25:30,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-13 06:25:30,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-13 06:25:30,685 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,SelfDestructingSolverStorable38 [2024-11-13 06:25:30,686 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-11-13 06:25:30,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:25:30,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1796665557, now seen corresponding path program 2 times [2024-11-13 06:25:30,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:25:30,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965221412] [2024-11-13 06:25:30,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:25:30,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:25:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:25:32,723 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 06:25:32,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:25:32,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965221412] [2024-11-13 06:25:32,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965221412] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:25:32,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251782270] [2024-11-13 06:25:32,724 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 06:25:32,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:25:32,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:25:32,726 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-11-13 06:25:32,727 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-11-13 06:25:34,880 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 06:25:34,881 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 06:25:34,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-11-13 06:25:34,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:25:34,993 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-13 06:25:34,994 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-11-13 06:25:35,021 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-11-13 06:25:35,088 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-11-13 06:25:35,208 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 06:25:35,209 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-11-13 06:25:35,297 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 06:25:35,298 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-11-13 06:25:36,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 06:25:36,932 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-11-13 06:25:37,054 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-11-13 06:25:37,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:25:37,339 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-11-13 06:25:37,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:25:37,369 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-11-13 06:25:37,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:25:37,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-11-13 06:25:37,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:25:37,425 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-11-13 06:25:37,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:25:37,712 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-11-13 06:25:37,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:25:37,730 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-11-13 06:25:37,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:25:37,777 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-11-13 06:25:37,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:25:37,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 30 treesize of output 21 [2024-11-13 06:25:37,922 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-13 06:25:37,922 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-11-13 06:25:38,217 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-11-13 06:25:38,234 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-11-13 06:25:38,297 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-11-13 06:25:38,313 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-11-13 06:25:38,332 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-11-13 06:25:38,424 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-11-13 06:25:38,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 37 treesize of output 26 [2024-11-13 06:25:38,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 37 treesize of output 26 [2024-11-13 06:25:38,482 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-11-13 06:25:38,822 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-11-13 06:25:38,839 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-11-13 06:25:38,854 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-11-13 06:25:38,873 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-11-13 06:25:38,958 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-11-13 06:25:39,001 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 06:25:39,001 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:25:39,016 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-11-13 06:25:39,044 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_~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))) (= |c_t_funThread1of2ForFork0_#t~nondet49#1| (select (select (store (store |c_#race| |c_t_funThread2of2ForFork0_insert_~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_~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_~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|)))) is different from false [2024-11-13 06:25:39,082 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-11-13 06:25:39,093 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-11-13 06:25:39,110 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-11-13 06:25:39,540 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-11-13 06:25:39,556 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-11-13 06:25:39,607 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-11-13 06:25:39,633 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-11-13 06:25:39,658 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-11-13 06:25:43,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:25:43,631 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-11-13 06:25:43,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:25:43,640 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-11-13 06:25:43,645 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-11-13 06:25:43,649 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-11-13 06:25:43,652 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-11-13 06:25:43,674 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:25:43,680 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:25:43,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:25:43,688 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-11-13 06:25:43,690 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:25:43,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:25:43,694 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-11-13 06:25:43,700 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-11-13 06:25:43,703 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-11-13 06:25:43,711 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:25:43,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:25:43,718 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-11-13 06:25:43,720 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:25:43,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:25:43,724 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-11-13 06:25:43,730 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-11-13 06:25:43,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 11 treesize of output 7 [2024-11-13 06:25:50,079 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 06:25:50,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251782270] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:25:50,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:25:50,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 26, 22] total 64 [2024-11-13 06:25:50,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662525211] [2024-11-13 06:25:50,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:25:50,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-11-13 06:25:50,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:25:50,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-11-13 06:25:50,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=2683, Unknown=54, NotChecked=1150, Total=4160 [2024-11-13 06:25:50,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:25:50,088 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:25:50,091 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-11-13 06:25:50,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:25:50,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:25:50,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:25:50,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:25:50,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:25:50,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:25:50,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:25:50,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:25:50,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:25:50,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:25:50,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:25:50,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-11-13 06:25:50,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-13 06:25:50,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:25:50,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-13 06:25:50,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-11-13 06:25:50,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:26:05,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:26:05,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:26:05,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:26:05,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:26:05,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:26:05,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:26:05,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:26:05,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:26:05,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 06:26:05,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:26:05,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:26:05,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-13 06:26:05,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-13 06:26:05,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:26:05,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 06:26:05,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-13 06:26:05,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-13 06:26:05,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-13 06:26:05,346 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,SelfDestructingSolverStorable39 [2024-11-13 06:26:05,347 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-11-13 06:26:05,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:26:05,348 INFO L85 PathProgramCache]: Analyzing trace with hash -309219138, now seen corresponding path program 3 times [2024-11-13 06:26:05,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:26:05,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909961236] [2024-11-13 06:26:05,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:26:05,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:26:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:26:07,132 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 06:26:07,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:26:07,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909961236] [2024-11-13 06:26:07,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909961236] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:26:07,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736492089] [2024-11-13 06:26:07,133 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 06:26:07,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:26:07,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:26:07,134 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-11-13 06:26:07,136 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-11-13 06:26:11,823 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-13 06:26:11,823 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 06:26:11,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 90 conjuncts are in the unsatisfiable core [2024-11-13 06:26:11,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:26:11,963 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-13 06:26:11,963 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-11-13 06:26:12,114 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 06:26:12,114 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-11-13 06:26:12,341 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 06:26:12,341 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-11-13 06:26:14,354 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-11-13 06:26:14,424 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-11-13 06:26:14,515 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-11-13 06:26:14,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:26:14,916 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-11-13 06:26:15,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:26:15,032 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-11-13 06:26:15,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:26:15,059 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-11-13 06:26:15,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:26:15,103 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-11-13 06:26:15,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:26:15,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:26:15,672 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-11-13 06:26:15,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:26:15,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:26:15,806 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-11-13 06:26:15,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:26:15,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:26:15,842 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-11-13 06:26:15,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:26:15,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:26:15,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:26:15,889 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-11-13 06:26:32,383 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2024-11-13 06:26:32,383 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-11-13 06:26:33,484 INFO L349 Elim1Store]: treesize reduction 32, result has 45.8 percent of original size [2024-11-13 06:26:33,485 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-11-13 06:26:42,208 INFO L349 Elim1Store]: treesize reduction 72, result has 54.1 percent of original size [2024-11-13 06:26:42,208 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-11-13 06:26:54,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:26:54,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:26:54,394 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-11-13 06:27:12,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:27:12,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:27:12,723 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-11-13 06:27:14,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:27:14,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:27:14,331 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-11-13 06:28:11,875 WARN L286 SmtUtils]: Spent 19.59s 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)